Convergence of some algorithms for convex minimization
- 1 February 1993
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 62 (1-3), 261-275
- https://doi.org/10.1007/bf01585170
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the Convergence of the Proximal Point Algorithm for Convex MinimizationSIAM Journal on Control and Optimization, 1991
- Proximity control in bundle methods for convex nondifferentiable minimizationMathematical Programming, 1990
- Numerical methods for nondifferentiable convex optimizationPublished by Springer Science and Business Media LLC ,1987
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth OptimizationIMA Journal of Numerical Analysis, 1986
- A descent algorithm for nonsmooth convex optimizationMathematical Programming, 1984
- An aggregate subgradient method for nonsmooth convex minimizationMathematical Programming, 1983
- ON A BUNDLE ALGORITHM FOR NONSMOOTH OPTIMIZATIONPublished by Elsevier BV ,1981
- An extension of davidon methods to non differentiable problemsPublished by Springer Science and Business Media LLC ,1975
- The Cutting-Plane Method for Solving Convex ProgramsJournal of the Society for Industrial and Applied Mathematics, 1960
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959