Decomposition Methods Based on Augmented Lagrangians: A Survey

DOI10.1007/978-1-4419-9640-4_11zbMath1247.90249OpenAlexW137174213MaRDI QIDQ2912155

Abdelouahed Hamdi, Shashi Kant 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

Mathematics Subject Classification ID

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

Related Items

An alternating trust region algorithm for distributed linearly constrained nonlinear programs, application to the optimal power flow problem, Application of decomposition techniques in a wildfire suppression optimization model, Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization, Constraint qualifications and optimality criteria for nonsmooth multiobjective programming problems on Hadamard manifolds, On alternating direction method for solving variational inequality problems with separable structure, Distributed optimization and control with ALADIN, Path-following gradient-based decomposition algorithms for separable convex optimization, Parallel LQP alternating direction method for solving variational inequality problems with separable structure, Decentralized optimization over tree graphs, An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization, Dual–primal proximal point algorithms for extended convex programming

Cites Work

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