Parallel Subgradient Methods for Convex Optimization
- 1 January 2001
- book chapter
- book charpter
- Published by Elsevier BV
- Vol. 8, 335-344
- https://doi.org/10.1016/s1570-579x(01)80020-3
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex ProblemsSIAM Journal on Optimization, 2000
- Surrogate Gradient Algorithm for Lagrangian RelaxationJournal of Optimization Theory and Applications, 1999
- The Efficiency of Ballstep Subgradient Level Methods for Convex OptimizationMathematics of Operations Research, 1999
- Error Stability Properties of Generalized Gradient-Type AlgorithmsJournal of Optimization Theory and Applications, 1998