A class of convergent primal-dual subgradient algorithms for decomposable convex programs
- 1 July 1986
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 35 (3) , 279-297
- https://doi.org/10.1007/bf01580881
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A descent algorithm for nonsmooth convex optimizationMathematical Programming, 1984
- An aggregate subgradient method for nonsmooth convex minimizationMathematical Programming, 1983
- On the choice of step size in subgradient optimizationEuropean Journal of Operational Research, 1981
- CONVERGENCE RESULTS IN A CLASS OF VARIABLE METRIC SUBGRADIENT METHODS11This research was supported in part by the D.G.E.S. (Quebec), the N.S.E.R.C. of Canada under grant A 4152, and the S.S.H.R.C. of Canada.Published by Elsevier ,1981
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- Combined Primal-Dual and Penalty Methods for Constrained MinimizationSIAM Journal on Control, 1975
- Validation of subgradient optimizationMathematical Programming, 1974
- Generalized Benders decompositionJournal of Optimization Theory and Applications, 1972
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954