New dual-type decomposition algorithm for nonconvex separable optimization problems
- 31 March 1989
- journal article
- Published by Elsevier in Automatica
- Vol. 25 (2) , 233-242
- https://doi.org/10.1016/0005-1098(89)90076-9
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problemIEEE Transactions on Automatic Control, 1985
- A globally convergent, implementable multiplier method with automatic penalty limitationApplied Mathematics & Optimization, 1980
- Convexification procedures and decomposition methods for nonconvex optimization problemsJournal of Optimization Theory and Applications, 1979
- Decomposition in large system optimization using the method of multipliersJournal of Optimization Theory and Applications, 1978
- The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimizationJournal of Optimization Theory and Applications, 1975
- A general saddle point result for constrained optimizationMathematical Programming, 1973