An augmented Lagrangian based algorithm for distributed nonconvex optimization
From MaRDI portal
(Redirected from Publication:2805706)
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
Cites work
- scientific article; zbMATH DE number 4133840 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3736490 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 107545 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 780774 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization
- A Globally Convergent Stabilized SQP Method
- A New Algorithm for Solving Strictly Convex Quadratic Programs
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A globally convergent method for nonlinear programming
- A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
- A parallel quadratic programming method for dynamic optimization problems
- A primal-dual augmented Lagrangian
- A proximal-based deomposition method for compositions method for convex minimization problems
- A quadratically convergent algorithm for solving infinite dimensional inequalities
- A quadratically convergent inexact SQP method for optimal control of differential algebraic equations
- Accelerated gradient methods and dual decomposition in distributed model predictive control
- An External Active-Set Strategy for Solving Optimal Control Problems
- An active set strategy for solving optimization problems with up to 200,000,000 nonlinear constraints
- An adjoint-based SQP algorithm with quasi-Newton Jacobian updates for inequality constrained optimization
- An inexact perturbed path-following method for Lagrangian decomposition in large-scale separable convex optimization
- An online active set strategy to overcome the limitations of explicit MPC
- Application of a Smoothing Technique to Decomposition in Convex Optimization
- Augmented lagrangians in semi-infinite programming
- Benchmarking large-scale distributed convex quadratic programming algorithms
- Convex Analysis
- Convexification procedures and decomposition methods for nonconvex optimization problems
- Decomposition in large system optimization using the method of multipliers
- Decomposition methods based on augmented Lagrangians: a survey
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Fast alternating direction optimization methods
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Interior-point Lagrangian decomposition method for separable convex optimization
- Market Mechanisms and Mathematical Programming
- Multiplier and gradient methods
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On Feasibility, Stability and Performance in Distributed Model Predictive Control
- On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Some Properties of the Augmented Lagrangian in Cone Constrained Optimization
- The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints
Cited in
(31)- Distributed optimal control of nonlinear systems using a second-order augmented Lagrangian method
- Sensitivity-based distributed model predictive control for non-linear systems under inexact optimization
- Low-Complexity Method for Hybrid MPC with Local Guarantees
- Fast and stable nonconvex constrained distributed optimization: the ELLADA algorithm
- Distributed Augmented Lagrangian Method for Link-Based Resource Sharing Problems of Multiagent Systems
- Fast and lightweight: a real-time parallelizable MPC for embedded systems
- A distributed asynchronous method of multipliers for constrained nonconvex optimization
- Distributed algorithms for convex problems with linear coupling constraints
- Augmented Lagrange algorithms for distributed optimization over multi-agent networks via edge-based method
- 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
- Analysis of the alternating direction method of multipliers for nonconvex problems
- ALADIN‐—An open‐source MATLAB toolbox for distributed non‐convex optimization
- 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
- A distributed algorithm for high-dimension convex quadratically constrained quadratic programs
- Hierarchical distributed optimization of constraint-coupled convex and mixed-integer programs using approximations of the dual function
- Parallel alternating direction method of multipliers
- Feasibility vs. Optimality in Distributed AC OPF: A Case Study Considering ADMM and ALADIN
- Practical prescribed-time distributed nonconvex optimization via a time-base generator
- 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
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)
