Decomposition methods based on augmented Lagrangians: a survey

DOI10.1007/978-1-4419-9640-4_11zbMATH Open1247.90249OpenAlexW137174213MaRDI QIDQ2912155FDOQ2912155

Authors: Abdelouahed Hamdi, S. K. Mishra 

Publication date: 14 September 2012

Published in: Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4419-9640-4_11

Recommendations

• On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
• scientific article; zbMATH DE number 1488005
• A Decomposition Method Based On The Augmented Lagrangian
• scientific article; zbMATH DE number 3892958
• scientific article; zbMATH DE number 3959124

Mathematics Subject Classification ID

Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Cites Work

• Parallel alternating direction multiplier decomposition of convex programs
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Title not available (Why is that?)
• Multiplier and gradient methods
• Title not available (Why is that?)
• A proximal-based deomposition method for compositions method for convex minimization problems
• The multiplier method of Hestenes and Powell applied to convex programming
• On the convergence of the exponential multiplier method for convex programming
• Modified barrier functions (theory and methods)
• Approximation procedures based on the method of multipliers
• A logarithmic-quadratic proximal method for variational inequalities
• A new inexact alternating directions method for monotone variational inequalities
• Title not available (Why is that?)
• Convergence of Proximal-Like Algorithms
• On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
• Title not available (Why is that?)
• Convergence Rates in Forward--Backward Splitting
• Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
• Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
• Proximal minimization algorithm with \(D\)-functions
• Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
• A variable-penalty alternating directions method for convex optimization
• A New Class of Augmented Lagrangians in Nonlinear Programming
• Title not available (Why is that?)
• A dual approach to solving nonlinear programming problems by unconstrained optimization
• Proximal Decomposition on the Graph of a Maximal Monotone Operator
• A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
• Partial inverse of a monotone operator
• Multiplier methods: A survey
• Title not available (Why is that?)
• Unconstrained Lagrangians in Nonlinear Programming
• Applications of the method of partial inverses to convex programming: Decomposition
• Primal-dual nonlinear rescaling method for convex optimization
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Penalty/Barrier Multiplier Methods for Convex Programming Problems
• Proximal Decomposition Via Alternating Linearization
• Two-level primal-dual proximal decomposition technique to solve large scale optimization problems
• Decomposition for structured convex programs with smooth multiplier methods
• A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
• On the method of multipliers for mathematical programming problems
• Entropic proximal decomposition methods for convex programs and variational inequalities
• An accelerated multiplier method for nonlinear programming
• New decomposition methods for solving variational inequality problems.
• Decomposition method for a class of monotone variational inequality problems
• A diagonal quadratic approximation method for large scale linear programs
• Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
• Nonlinear proximal decomposition method for convex programming
• The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
• Separable diagonalized multiplier method for decomposition nonlinear programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Log-sigmoid multipliers method in constrained optimization
• Separable augmented Lagrangian algorithm with multidimensional scaling for monotropic programming
• On the method of multipliers for convex programming
• Decomposition in large system optimization using the method of multipliers
• New dual-type decomposition algorithm for non-convex separable optimization problems
• Title not available (Why is that?)
• A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints
• Convexification procedures and decomposition methods for nonconvex optimization problems
• Family of perturbation methods for variational inequalities
• New results on a class of exact augmented Lagrangians
• A new augmented Lagrangian function for inequality constraints in nonlinear programming problems
• Combined Primal–Dual and Penalty Methods for Convex Programming
• Use of the augmented penalty function in mathematical programming problems. I: Ordinary gradient algorithm
• Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints
• Augmented Lagrangians which are quadratic in the multiplier
• Constrained optimization problems using multiplier methods
• Approximation of the classical isoperimetric problem
• A method for solving a quadratic optimal control problems
• Title not available (Why is that?)
• A Nonlinear Optimal Control Minimization Technique
• A new approach to constrained function optimization
• Title not available (Why is that?)
• A new method for the optimization of a nonlinear function subject to nonlinear constraints
• Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization
• A globally convergent, implementable multiplier method with automatic penalty limitation
• Title not available (Why is that?)
• A primal-dual algorithm for monotropic programming and its application to network optimization
• A re-scaled twin augmented Lagrangian algorithm for saddle point seeking
• A general saddle point result for constrained optimization
• Title not available (Why is that?)
• A gradient projection-multiplier method for nonlinear programming
• Complete decomposition algorithm for nonconvex separable optimization problems and applications
• Use of the augmented penalty function in mathematical programming problems. II. Conjugate gradient-restoration algorithm
• Title not available (Why is that?)
• Local convergence of the diagonalized method of multipliers
• Title not available (Why is that?)
• Parallel Constraint Distribution

Cited In (18)

• Parallel LQP alternating direction method for solving variational inequality problems with separable structure
• A Decomposition Method Based On The Augmented Lagrangian
• Constraint qualifications and optimality criteria for nonsmooth multiobjective programming problems on Hadamard manifolds
• Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
• An alternating trust region algorithm for distributed linearly constrained nonlinear programs, application to the optimal power flow problem
• Modified Lagrangian methods for separable optimization problems
• Path-following gradient-based decomposition algorithms for separable convex optimization
• An augmented Lagrangian decomposition method for block diagonal linear programming problems
• Decentralized optimization over tree graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dual-primal proximal point algorithms for extended convex programming
• An augmented Lagrangian based algorithm for distributed nonconvex optimization
• Application of decomposition techniques in a wildfire suppression optimization model
• On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems
• On alternating direction method for solving variational inequality problems with separable structure
• Lagrangian methods for composite optimization
• Distributed optimization and control with ALADIN

This page was built for publication: Decomposition methods based on augmented Lagrangians: a survey

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