Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints

DOI10.1007/BF00940031zbMath0713.90059OpenAlexW2128610608MaRDI QIDQ750303

B. Engelmann, Piotr Tatjewski

Publication date: 1990

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940031

zbMATH Keywords

convergence analysisnonconvexitylarge-scale nonconvex optimizationdual method of decompositionseparable minimizationtwo-level primal-dual decomposition technique

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Decomposition methods (49M27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ Convexification and decomposition of separable nonconvex optimization problems ⋮ Two-level primal-dual proximal decomposition technique to solve large scale optimization problems ⋮ An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization ⋮ Decomposition for structured convex programs with smooth multiplier methods

Cites Work

• Decomposition in large system optimization using the method of multipliers
• Convexification procedures and decomposition methods for nonconvex optimization problems
• The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
• A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints