A regularized decomposition method for minimizing a sum of polyhedral functions
- 1 July 1986
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 35 (3) , 309-333
- https://doi.org/10.1007/bf01580883
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A weighted gram-schmidt method for convex quadratic programmingMathematical Programming, 1984
- Equivalence of some quadratic programming algorithmsMathematical Programming, 1984
- An aggregate subgradient method for nonsmooth convex minimizationMathematical Programming, 1983
- Solving stochastic programming problems with recourse including error boundsMathematische Operationsforschung und Statistik. Series Optimization, 1982
- ON A BUNDLE ALGORITHM FOR NONSMOOTH OPTIMIZATIONPublished by Elsevier ,1981
- Numerically stable methods for quadratic programmingMathematical Programming, 1978
- Matrix augmentation and partitioning in the updating of the basis inverseMathematical Programming, 1977
- The Boxstep Method for Large-Scale OptimizationOperations Research, 1975
- A method of conjugate subgradients for minimizing nondifferentiable functionsPublished by Springer Nature ,1975
- Generalized upper bounding techniquesJournal of Computer and System Sciences, 1967