Separable diagonalized multiplier method for decomposition nonlinear programs

MaRDI QIDQ2381876zbMATH OpenFDO

Authors Abdelouahed Hamdi, Philippe Mahey

Publication date 19 September 2007

Published in Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

augmented Lagrangiandecompositionnon-convex programmingproximal regularization

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• Decomposition for structured convex programs with smooth multiplier methods
• scientific article; zbMATH DE number 1283896
• Publication:3484637
• Application of the alternating direction method of multipliers to separable convex programming problems
• New dual-type decomposition algorithm for non-convex separable optimization problems

Cited in

(9)

• A decomposition procedure based on approximate Newton directions
• Two-level primal-dual proximal decomposition technique to solve large scale optimization problems
• Decomposition for structured convex programs with smooth multiplier methods
• Decomposition methods based on augmented Lagrangians: a survey
• scientific article; zbMATH DE number 1283896 (Why is no real title available?)
• Modified Lagrangian methods for separable optimization problems
• An asymmetric proximal decomposition method for convex programming with linearly coupling constraints
• On Decomposition Methods for a Class of Partially Separable Nonlinear Programs
• Space-decomposition multiplier method for constrained minimization problems

This page was built for publication: Separable diagonalized multiplier method for decomposition nonlinear programs

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