Two-level primal-dual proximal decomposition technique to solve large scale optimization problems

DOI10.1016/j.amc.2003.11.040zbMath1122.90061OpenAlexW2092235910MaRDI QIDQ1764717

Abdelouahed Hamdi

Publication date: 22 February 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2003.11.040

zbMATH Keywords

Nonconvex programmingDecompositionMultiplier methodsProximal regularization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (7)

Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems ⋮ Modified Lagrangian methods for separable optimization problems ⋮ Path-following gradient-based decomposition algorithms for separable convex optimization ⋮ Fast inexact decomposition algorithms for large-scale separable convex optimization ⋮ Decentralized optimization over tree graphs ⋮ Decomposition for structured convex programs with smooth multiplier methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints
• Enlarging the region of convergence of Newton's method for constrained optimization
• Complete decomposition algorithm for nonconvex separable optimization problems and applications
• Application of the alternating direction method of multipliers to separable convex programming problems
• Convexification procedures and decomposition methods for nonconvex optimization problems
• The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
• Separable diagonalized multiplier method for decomposition nonlinear programs
• A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
• Applications of the method of partial inverses to convex programming: Decomposition
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Proximal Decomposition on the Graph of a Maximal Monotone Operator

This page was built for publication: Two-level primal-dual proximal decomposition technique to solve large scale optimization problems