An interior point subgradient method for linearly constrained nondifferentiable convex programming
Explore this paper's citation graph
- Type
- preprint
- Published
- 1996-01-01
- Cited by
- 0
- References
- 0
- OpenAlex
- https://openalex.org/W3122824141
Keywords
Subgradient method, Interior point method, Mathematics, Minimax, Mathematical optimization
References
No references recorded for this paper.
Cited by
No citing papers recorded for this paper.
Related papers
- An interior point subgradient method for linearly constrained nondifferentiable convex programming
- Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- The Projected Subgradient Method for Nonsmooth Convex Optimization in the Presence of Computational Errors
- Convex Optimization with Computational Errors
- An aggregate subgradient method for nonsmooth convex minimization
- An implementation of a reduced subgradient method via Luenberger-Mokhtar variant
- An Aggregate Subgradient Descent Method for Solving Large Convex Nonsmooth Multiobjective Minimization Problems
- Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems