An aggregate subgradient method for nonsmooth convex minimization
- 1 October 1983
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 27 (3), 320-341
- https://doi.org/10.1007/bf02591907
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimizationPublished by Springer Nature ,1982
- An Algorithm for Constrained Optimization with Semismooth FunctionsMathematics of Operations Research, 1977
- Quasi-Newton Methods, Motivation and TheorySIAM Review, 1977
- Finding the nearest point in A polytopeMathematical Programming, 1976
- The Boxstep Method for Large-Scale OptimizationOperations Research, 1975
- A method of conjugate subgradients for minimizing nondifferentiable functionsPublished by Springer Nature ,1975
- The Cutting-Plane Method for Solving Convex ProgramsJournal of the Society for Industrial and Applied Mathematics, 1960