On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
From MaRDI portal
Publication:4864877
DOI10.1287/moor.20.3.634zbMath0845.90098OpenAlexW1991482609MaRDI QIDQ4864877
Publication date: 25 February 1996
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.20.3.634
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Stochastic programming (90C15)
Related Items
Parallelizable preprocessing method for multistage stochastic programming problems ⋮ Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ Solving dynamic stochastic economic models by mathematical programming decomposition methods ⋮ Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization ⋮ Decomposition methods in stochastic programming ⋮ Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems ⋮ On augmented Lagrangian decomposition methods for multistage stochastic programs ⋮ Estimating arrival rate of nonhomogeneous Poisson processes with semidefinite programming ⋮ A classification of methods for distributed system optimization based on formulation structure ⋮ Separable approximations and decomposition methods for the augmented Lagrangian ⋮ A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems ⋮ A review of decentralized optimization focused on information flows of decomposition algorithms ⋮ On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems ⋮ Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes ⋮ An augmented Lagrangian relaxation for analytical target cascading using the alternating direction method of multipliers ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment ⋮ An augmented Lagrangian method for distributed optimization ⋮ A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems ⋮ Path-following gradient-based decomposition algorithms for separable convex optimization ⋮ A re-scaled twin augmented Lagrangian algorithm for saddle point seeking ⋮ On the implementation of a log-barrier progressive hedging method for multistage stochastic programs ⋮ Duality gaps in nonconvex stochastic optimization ⋮ A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming ⋮ Divide to conquer: decomposition methods for energy optimization ⋮ Fast inexact decomposition algorithms for large-scale separable convex optimization ⋮ Hub-and-spoke network design and fleet deployment for string planning of liner shipping ⋮ Large-scale unit commitment under uncertainty ⋮ Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing ⋮ Parallel coordinate descent methods for big data optimization
