Parallel alternating direction multiplier decomposition of convex programs

DOI10.1007/BF02196592zbMath0797.90075OpenAlexW1980693794MaRDI QIDQ1321443

Jonathan Eckstein

Publication date: 25 October 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02196592

zbMATH Keywords

parallel algorithmsalternating direction methodepigraphic projection method

Mathematics Subject Classification ID

Convex programming (90C25) Parallel numerical computation (65Y05)

Related Items (23)

A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming ⋮ Linearized symmetric multi-block ADMM with indefinite proximal regularization and optimal proximal parameter ⋮ Proximal Splitting Methods in Signal Processing ⋮ Conic optimization via operator splitting and homogeneous self-dual embedding ⋮ Iteration-complexity analysis of a generalized alternating direction method of multipliers ⋮ Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ Distributed support vector machine in master-slave mode ⋮ Projective method of multipliers for linearly constrained convex minimization ⋮ Linearized generalized ADMM-based algorithm for multi-block linearly constrained separable convex programming in real-world applications ⋮ A new stopping criterion for Eckstein and Bertsekas's generalized alternating direction method of multipliers ⋮ Modified Lagrangian methods for separable optimization problems ⋮ On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers ⋮ A re-scaled twin augmented Lagrangian algorithm for saddle point seeking ⋮ OSQP: An Operator Splitting Solver for Quadratic Programs ⋮ A proximal subgradient projection algorithm for linearly constrained strictly convex problems ⋮ The generalized proximal point algorithm with step size 2 is not necessarily convergent ⋮ Low Complexity Regularization of Linear Inverse Problems ⋮ Generalized alternating direction method of multipliers: new theoretical insights and applications ⋮ On the asymptotic linear convergence speed of Anderson acceleration applied to ADMM ⋮ An alternating direction method for solving convex nonlinear semidefinite programming problems ⋮ An ADMM-based interior-point method for large-scale linear programming ⋮ Spatially varying coefficient models with sign preservation of the coefficient functions ⋮ Decomposition for structured convex programs with smooth multiplier methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial inverse of a monotone operator
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Applications of the method of partial inverses to convex programming: Decomposition
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• 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
• Convex Analysis

This page was built for publication: Parallel alternating direction multiplier decomposition of convex programs