An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization
From MaRDI portal
Publication:2805706
DOI10.1137/140975991zbMath1345.90069OpenAlexW2345986964MaRDI QIDQ2805706
Moritz Diehl, Janick V. Frasch, Boris Houska
Publication date: 13 May 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2fe4e6108f99ae336d41218ee83c6bde2e54283b
Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Distributed algorithms (68W15)
Related Items
Fast and stable nonconvex constrained distributed optimization: the ELLADA algorithm ⋮ Recent advances in quadratic programming algorithms for nonlinear model predictive control ⋮ A modular framework for distributed model predictive control of nonlinear continuous-time systems (GRAMPC-D) ⋮ ALADIN‐—An open‐source MATLAB toolbox for distributed non‐convex optimization ⋮ Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization ⋮ Training recurrent neural networks by sequential least squares and the alternating direction method of multipliers ⋮ An event-triggered collaborative neurodynamic approach to distributed global optimization ⋮ Distributed optimal control of nonlinear systems using a second-order augmented Lagrangian method ⋮ Distributed modifier-adaptation schemes for the real-time optimisation of uncertain interconnected systems ⋮ Analysis of the alternating direction method of multipliers for nonconvex problems ⋮ Feasibility vs. Optimality in Distributed AC OPF: A Case Study Considering ADMM and ALADIN ⋮ Optimization and stabilization of hierarchical electrical networks ⋮ Distributed optimization and control with ALADIN ⋮ Decomposition-based inner- and outer-refinement algorithms for global optimization ⋮ Decentralized optimization over tree graphs ⋮ Partially distributed outer approximation ⋮ Low-Complexity Method for Hybrid MPC with Local Guarantees ⋮ Proximal ADMM for nonconvex and nonsmooth optimization ⋮ A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Accelerated gradient methods and dual decomposition in distributed model predictive control
- A primal-dual augmented Lagrangian
- A parallel quadratic programming method for dynamic optimization problems
- An active set strategy for solving optimization problems with up to 200,000,000 nonlinear constraints
- Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints
- Interior-point Lagrangian decomposition method for separable convex optimization
- Augmented lagrangians in semi-infinite programming
- A quadratically convergent algorithm for solving infinite dimensional inequalities
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A globally convergent method for nonlinear programming
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Decomposition in large system optimization using the method of multipliers
- Convexification procedures and decomposition methods for nonconvex optimization problems
- A proximal-based deomposition method for compositions method for convex minimization problems
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
- Multiplier and gradient methods
- Decomposition Methods Based on Augmented Lagrangians: A Survey
- Benchmarking large-scale distributed convex quadratic programming algorithms
- On Feasibility, Stability and Performance in Distributed Model Predictive Control
- An adjoint-based SQP algorithm with quasi-Newton Jacobian updates for inequality constrained optimization
- A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
- Market Mechanisms and Mathematical Programming
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
- A New Algorithm for Solving Strictly Convex Quadratic Programs
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Application of a Smoothing Technique to Decomposition in Convex Optimization
- An External Active-Set Strategy for Solving Optimal Control Problems
- Fast Alternating Direction Optimization Methods
- An Inexact Perturbed Path-Following Method for Lagrangian Decomposition in Large-Scale Separable Convex Optimization
- A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization
- An online active set strategy to overcome the limitations of explicit MPC
- A Globally Convergent Stabilized SQP Method
- A quadratically convergent inexact SQP method for optimal control of differential algebraic equations
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Convex Analysis
- Some Properties of the Augmented Lagrangian in Cone Constrained Optimization
This page was built for publication: An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization
