An augmented Lagrangian method for distributed optimization
From MaRDI portal
Publication:494348
DOI10.1007/s10107-014-0808-7zbMath1327.90198OpenAlexW1973889396MaRDI QIDQ494348
Nikolaos Chatzipanagiotis, Michael M. Zavlanos, Dentcheva, Darinka
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
stochastic programmingconvex optimizationalternating direction methodnetwork optimizationdiagonal quadratic approximationmonotropic programming
Related Items
Distributed Continuous-Time Algorithms for Nonsmooth Extended Monotropic Optimization Problems, A unitary distributed subgradient method for multi-agent optimization with different coupling sources, A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems, Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle, Distributed conditional cooperation model predictive control of interconnected microgrids, Distributed communication-aware coverage control by mobile sensor networks, On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems, Incremental Bundle Methods using Upper Models, Augmented Lagrangian optimization under fixed-point arithmetic, Projected primal-dual gradient flow of augmented Lagrangian with application to distributed maximization of the algebraic connectivity of a network, Analysis of the alternating direction method of multipliers for nonconvex problems, Distributed constraint optimization on networked multi-agent systems, Convergence of the augmented decomposition algorithm, Distributed stochastic gradient tracking methods, Selective linearization for multi-block statistical learning, Regularized decomposition of large scale block-structured robust optimization problems, A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
Cites Work
- 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
- Extended monotropic programming and duality
- 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
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Decomposition in large system optimization using the method of multipliers
- A proximal-based deomposition method for compositions method for convex minimization 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
- Multiplier and gradient methods
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Network Optimization and Control
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2
- An Extension of the DQA Algorithm to Convex Stochastic Programs
- Proximal Decomposition Via Alternating Linearization
- On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
