Convexification and decomposition of separable nonconvex optimization problems

DOI10.1080/02331939208843843MaRDI QIDQ4327962zbMATH OpenOpenAlexFDO

Authors Bernd Engelmann

Publication date 27 March 1995

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331939208843843

zbMATH Keywords

additive separable, nonconvex optimizationaugmented Lagrangianconvexificationcoordinationdecompositionmultiplier shiftsecond-order sufficient optimality conditions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 4145673
• Publication:3484637
• New dual-type decomposition algorithm for non-convex separable optimization problems
• scientific article; zbMATH DE number 1086732
• A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem

Cites work

• A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
• Application of the method of multipliers to state space constrained optimal control problems with discrete time
• Applications of the method of partial inverses to convex programming: Decomposition
• Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
• Convexification procedures and decomposition methods for nonconvex optimization problems
• Decomposition in large system optimization using the method of multipliers
• scientific article; zbMATH DE number 3849051 (Why is no real title available?)
• scientific article; zbMATH DE number 3914081 (Why is no real title available?)
• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
• Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints

Cited in

(17)

• Complete decomposition algorithm for nonconvex separable optimization problems and applications
• New dual-type decomposition algorithm for non-convex separable optimization problems
• On a decomposition method for nonconvex global optimization
• Separation of Nonconvex Sets with General Augmenting Functions
• scientific article; zbMATH DE number 4156208 (Why is no real title available?)
• A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
• New Partitioning Method for a Class of Nonconvex Optimization Problems
• Mixed coordination method for non-linear programming problems with separable structures
• scientific article; zbMATH DE number 1086732 (Why is no real title available?)
• Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
• scientific article; zbMATH DE number 7352423 (Why is no real title available?)
• Exact penalties for decomposable convex optimization problems
• scientific article; zbMATH DE number 7289916 (Why is no real title available?)
• Nonconvex sensitivity-based generalized Benders decomposition
• Convex predictor-nonconvex corrector optimization strategy with application to signal decomposition
• Interior-point Lagrangian decomposition method for separable convex optimization
• AAR-based decomposition algorithm for non-linear convex optimisation

This page was built for publication: Convexification and decomposition of separable nonconvex optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327962)