Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization
Authors:
- A. AuslenderAAA. Auslender
- M. TeboulleMTM. Teboulle
- 1 February 2004
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 29 (1) , 1-26
Abstract
No abstract availableThis publication has 33 references indexed in Scilit:
- Entropic proximal decomposition methods for convex programs and variational inequalitiesMathematical Programming, 2001
- A Log-Quadratic Projection Method for Convex Feasibility Problems2001
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous KernelsMathematics of Operations Research, 1999
- A Logarithmic-Quadratic Proximal Method for Variational InequalitiesComputational Optimization and Applications, 1999
- Penalty/Barrier Multiplier Methods for Convex Programming ProblemsSIAM Journal on Optimization, 1997
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalitiesMathematical Programming, 1995
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex ProgrammingMathematics of Operations Research, 1993
- Convergence of some algorithms for convex minimizationMathematical Programming, 1993
- Numerical methods for nondifferentiable convex optimization1987
- On the Goldstein-Levitin-Polyak gradient projection methodIEEE Transactions on Automatic Control, 1976