The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
- 1 March 1996
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 34 (2) , 660-676
- https://doi.org/10.1137/0334031
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and ExtensionsSIAM Journal on Control and Optimization, 1996
- Convex Analysis and Minimization Algorithms IPublished by Springer Nature ,1993
- Variable target value subgradient methodMathematical Programming, 1990
- Chapter VII Nondifferentiable optimizationPublished by Elsevier ,1989
- Technical Note—The Nested Ball Principle for the Relaxation MethodOperations Research, 1983
- On relaxation methods for systems of linear inequalitiesEuropean Journal of Operational Research, 1982
- Polynomial algorithms for a class of linear programsMathematical Programming, 1981
- On the choice of step size in subgradient optimizationEuropean Journal of Operational Research, 1981
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954