An augmented Lagrangian method for distributed optimization
From MaRDI portal
Publication:494348
DOI10.1007/S10107-014-0808-7zbMATH Open1327.90198OpenAlexW1973889396MaRDI QIDQ494348FDOQ494348
Authors: Nikolaos Chatzipanagiotis, Michael M. Zavlanos, Darinka Dentcheva 
Publication date: 31 August 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-014-0808-7
Recommendations
- An augmented Lagrangian based algorithm for distributed nonconvex optimization
- Interior-point Lagrangian decomposition method for separable convex optimization
- On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
- Modified Lagrangian methods for separable optimization problems
- Decomposition methods based on augmented Lagrangians: a survey
convex optimizationalternating direction methodstochastic programmingnetwork optimizationdiagonal quadratic approximationmonotropic programming
Cites Work
- 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
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Multiplier and gradient 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?)
- Title not available (Why is that?)
- Nonlinear optimization.
- Title not available (Why is that?)
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Title not available (Why is that?)
- On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- Title not available (Why is that?)
- Network Optimization and Control
- Proximal Decomposition Via Alternating Linearization
- A diagonal quadratic approximation method for large scale linear programs
- The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
- Extended monotropic programming and duality
- 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?)
- The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2
- An Extension of the DQA Algorithm to Convex Stochastic Programs
Cited In (23)
- Distributed Augmented Lagrangian Method for Link-Based Resource Sharing Problems of Multiagent Systems
- Distributed constraint optimization on networked multi-agent systems
- Convergence of the augmented decomposition algorithm
- Regularized decomposition of large scale block-structured robust optimization problems
- Differentially private distributed optimization for multi-agent systems via the augmented Lagrangian algorithm
- Distributed stochastic gradient tracking methods
- Augmented Lagrangian optimization under fixed-point arithmetic
- A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
- Analysis of the alternating direction method of multipliers for nonconvex problems
- Selective linearization for multi-block statistical learning
- Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle
- A machine-learning-accelerated distributed LBFGS method for field development optimization: algorithm, validation, and applications
- Distributed communication-aware coverage control by mobile sensor networks
- ADD-OPT: Accelerated Distributed Directed Optimization
- Distributed conditional cooperation model predictive control of interconnected microgrids
- Distributed Continuous-Time Algorithms for Nonsmooth Extended Monotropic Optimization Problems
- On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems
- Incremental Bundle Methods using Upper Models
- A unitary distributed subgradient method for multi-agent optimization with different coupling sources
- On risk evaluation and control of distributed multi-agent systems
- Hierarchical distributed optimization of constraint-coupled convex and mixed-integer programs using approximations of the dual function
- A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
- Projected primal-dual gradient flow of augmented Lagrangian with application to distributed maximization of the algebraic connectivity of a network
This page was built for publication: An augmented Lagrangian method for distributed optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494348)
