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

DOI10.1016/J.AMC.2003.11.040MaRDI QIDQ1764717zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints
• scientific article; zbMATH DE number 4091189
• A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
• New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization
• Applications of the method of partial inverses to convex programming: Decomposition

Cites work

• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• scientific article; zbMATH DE number 3575377 (Why is no real title available?)
• scientific article; zbMATH DE number 1086732 (Why is no real title available?)
• scientific article; zbMATH DE number 1488004 (Why is no real title available?)
• scientific article; zbMATH DE number 3354114 (Why is no real title available?)
• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
• Application of the alternating direction method of multipliers to separable convex programming problems
• Applications of the method of partial inverses to convex programming: Decomposition
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Complete decomposition algorithm for nonconvex separable optimization problems and applications
• Convexification procedures and decomposition methods for nonconvex optimization problems
• Enlarging the region of convergence of Newton's method for constrained optimization
• Proximal Decomposition on the Graph of a Maximal Monotone Operator
• Separable diagonalized multiplier method for decomposition nonlinear programs
• 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

(9)

• Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
• Decomposition for structured convex programs with smooth multiplier methods
• Fast inexact decomposition algorithms for large-scale separable convex optimization
• Modified Lagrangian methods for separable optimization problems
• scientific article; zbMATH DE number 4091189 (Why is no real title available?)
• Path-following gradient-based decomposition algorithms for separable convex optimization
• Decentralized optimization over tree graphs
• Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints
• Decomposition methods based on augmented Lagrangians: a survey

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

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