An augmented Lagrangian based algorithm for distributed nonconvex optimization
From MaRDI portal
Publication:2805706
DOI10.1137/140975991zbMATH Open1345.90069OpenAlexW2345986964MaRDI QIDQ2805706FDOQ2805706
Authors: Boris Houska, Janick Frasch, Moritz Diehl 
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
Recommendations
- An augmented Lagrangian method for distributed optimization
- A two-level distributed algorithm for nonconvex constrained optimization
- Parallel alternating direction method of multipliers
- A distributed asynchronous method of multipliers for constrained nonconvex optimization
- New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization
Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Distributed algorithms (68W15)
Cites Work
- Title not available (Why is that?)
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- A parallel quadratic programming method for dynamic optimization problems
- Title not available (Why is that?)
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Title not available (Why is that?)
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
- Title not available (Why is that?)
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Convex Analysis
- Title not available (Why is that?)
- Multiplier and gradient methods
- Fast Alternating Direction Optimization Methods
- Title not available (Why is that?)
- A proximal-based deomposition method for compositions method for convex minimization problems
- Title not available (Why is that?)
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Application of a Smoothing Technique to Decomposition in Convex Optimization
- An inexact perturbed path-following method for Lagrangian decomposition in large-scale separable convex optimization
- A globally convergent method for nonlinear programming
- Title not available (Why is that?)
- An active set strategy for solving optimization problems with up to 200,000,000 nonlinear constraints
- On Feasibility, Stability and Performance in Distributed Model Predictive Control
- A primal-dual augmented Lagrangian
- A Globally Convergent Stabilized SQP Method
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Title not available (Why is that?)
- Interior-point Lagrangian decomposition method for 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
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
- Accelerated gradient methods and dual decomposition in distributed model predictive control
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
- On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
- Some Properties of the Augmented Lagrangian in Cone Constrained Optimization
- Augmented lagrangians in semi-infinite programming
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- Decomposition in large system optimization using the method of multipliers
- A New Algorithm for Solving Strictly Convex Quadratic Programs
- Title not available (Why is that?)
- Convexification procedures and decomposition methods for nonconvex optimization problems
- An External Active-Set Strategy for Solving Optimal Control Problems
- Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints
- A quadratically convergent algorithm for solving infinite dimensional inequalities
- A quadratically convergent inexact SQP method for optimal control of differential algebraic equations
- Benchmarking large-scale distributed convex quadratic programming algorithms
- An adjoint-based SQP algorithm with quasi-Newton Jacobian updates for inequality constrained optimization
- Market Mechanisms and Mathematical Programming
- Decomposition methods based on augmented Lagrangians: a survey
Cited In (23)
- Low-Complexity Method for Hybrid MPC with Local Guarantees
- Distributed Augmented Lagrangian Method for Link-Based Resource Sharing Problems of Multiagent Systems
- Fast and stable nonconvex constrained distributed optimization: the ELLADA algorithm
- An event-triggered collaborative neurodynamic approach to distributed global optimization
- Asynchronous ADMM for nonlinear continuous-time systems
- Proximal ADMM for nonconvex and nonsmooth 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
- Recent advances in quadratic programming algorithms for nonlinear model predictive control
- A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
- ALADIN‐—An open‐source MATLAB toolbox for distributed non‐convex optimization
- Analysis of the alternating direction method of multipliers for nonconvex problems
- Decentralized optimization over tree graphs
- A modular framework for distributed model predictive control of nonlinear continuous-time systems (GRAMPC-D)
- Distributed modifier-adaptation schemes for the real-time optimisation of uncertain interconnected systems
- Partially distributed outer approximation
- Hierarchical distributed optimization of constraint-coupled convex and mixed-integer programs using approximations of the dual function
- Feasibility vs. Optimality in Distributed AC OPF: A Case Study Considering ADMM and ALADIN
- A two-level distributed algorithm for nonconvex constrained optimization
- Decomposition-based inner- and outer-refinement algorithms for global optimization
- Optimization and stabilization of hierarchical electrical networks
- Distributed optimization and control with ALADIN
- Distributed optimal control of nonlinear systems using a second-order augmented Lagrangian method
Uses Software
This page was built for publication: An augmented Lagrangian based algorithm for distributed nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805706)
