A new decomposition method in nonconvex programming via a separable augmented Lagrangian

MaRDI QIDQ4362982zbMATH OpenFDO

Authors Philippe Mahey, Jean-Pierre Dussault, Abdelouahed Hamdi

Publication date 19 February 1998

zbMATH Keywords

augmented Lagrangian methodconvergencedecomposition algorithmnonconvex programmingnumerical resultsproximal decomposition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Recommendations

• New dual-type decomposition algorithm for non-convex separable optimization problems
• Convexification and decomposition of separable nonconvex optimization problems
• scientific article; zbMATH DE number 4145673
• New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization

Cited in

(16)

• Two-level primal-dual proximal decomposition technique to solve large scale optimization problems
• New dual-type decomposition algorithm for non-convex separable optimization problems
• A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
• Decomposition for structured convex programs with smooth multiplier methods
• Decomposition methods based on augmented Lagrangians: a survey
• A survey on operator splitting and decomposition of convex programs
• Separation of Nonconvex Sets with General Augmenting Functions
• scientific article; zbMATH DE number 4145673 (Why is no real title available?)
• Convexification and decomposition of separable nonconvex optimization problems
• Modified Lagrangian methods for separable optimization problems
• An asymmetric proximal decomposition method for convex programming with linearly coupling constraints
• The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming
• On Decomposition Methods for a Class of Partially Separable Nonlinear Programs
• Separable augmented Lagrangian algorithm with multidimensional scaling for monotropic programming
• AAR-based decomposition algorithm for non-linear convex optimisation
• New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization

This page was built for publication: A new decomposition method in nonconvex programming via a separable augmented Lagrangian

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