New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization
Authors:
- 1 November 1990
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 67 (2) , 279-296
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- New Lagrangian function for nonconvex primal-dual decompositionComputers & Mathematics with Applications, 1987
- A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problemIEEE Transactions on Automatic Control, 1985
- Global konvergente Zerlegungsverfahren für nichtkonvexe OptimierungsproblemeComputing, 1984
- Convexification procedures and decomposition methods for nonconvex optimization problemsJournal of Optimization Theory and Applications, 1979
- A New Class of Augmented Lagrangians in Nonlinear ProgrammingSIAM Journal on Control and Optimization, 1979
- Monotone Operators and the Proximal Point AlgorithmSIAM Journal on Control and Optimization, 1976
- Multiplier methods: A surveyAutomatica, 1976
- A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraintsMathematical Programming, 1975
- A new method for the optimization of a nonlinear function subject to nonlinear constraintsThe Computer Journal, 1970
- Multiplier and gradient methodsJournal of Optimization Theory and Applications, 1969