Convexification procedures and decomposition methods for nonconvex optimization problems
- 1 October 1979
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 29 (2) , 169-197
- https://doi.org/10.1007/bf00937167
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Multiplier methods: A surveyAutomatica, 1976
- Combined Primal–Dual and Penalty Methods for Convex ProgrammingSIAM Journal on Control and Optimization, 1976
- On the method of multipliers for convex programmingIEEE Transactions on Automatic Control, 1975
- Combined Primal-Dual and Penalty Methods for Constrained MinimizationSIAM Journal on Control, 1975
- The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimizationJournal of Optimization Theory and Applications, 1975
- A dual approach to solving nonlinear programming problems by unconstrained optimizationMathematical Programming, 1973
- Duality in Nonlinear Programming: A Simplified Applications-Oriented DevelopmentSIAM Review, 1971
- Lagrange multipliers and nonlinear programmingJournal of Mathematical Analysis and Applications, 1967
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of ResourcesOperations Research, 1963
- Definite and Semidefinite Quadratic FormsEconometrica, 1952