New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization
DOI10.1007/BF00940477zbMath0696.90053OpenAlexW3171477431MaRDI QIDQ911470
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/bf00940477
convergence analysisdecompositionaugmented Lagrangianprimal-dual methodsnonconvex equality-constrained optimizationseparable structures
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Globally convergent decomposition methods for nonconvex optimization problems
- Multiplier methods: A survey
- 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
- Multiplier and gradient methods
- A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
- A New Class of Augmented Lagrangians in Nonlinear Programming
- A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- A new method for the optimization of a nonlinear function subject to nonlinear constraints
This page was built for publication: New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization
