Parallel alternating direction multiplier decomposition of convex programs
From MaRDI portal
Recommendations
- Parallel alternating direction method of multipliers
- scientific article; zbMATH DE number 1046042
- A Parallel Algorithm for a Class of Convex Programs
- A parallel descent algorithm for convex programming
- A parallel splitting method for separable convex programs
- Parallel computing in nonconvex programming
- Alternating Direction Methods on Multiprocessors
- Parallel interior point schemes for solving multistage convex programming
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- An inexact parallel alternating direction method for structured variational inequalities
Cites work
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- 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
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convex Analysis
- 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
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Partial inverse of a monotone operator
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2
Cited in
(28)- Iteration-complexity analysis of a generalized alternating direction method of multipliers
- A new stopping criterion for Eckstein and Bertsekas's generalized alternating direction method of multipliers
- A simple parallel algorithm with an \(O(1/t)\) convergence rate for general convex programs
- A Parallel Algorithm for a Class of Convex Programs
- Decomposition methods based on augmented Lagrangians: a survey
- Application of the alternating direction method of multipliers to separable convex programming problems
- Linearized symmetric multi-block ADMM with indefinite proximal regularization and optimal proximal parameter
- Modified Lagrangian methods for separable optimization problems
- Decomposition for structured convex programs with smooth multiplier methods
- Spatially varying coefficient models with sign preservation of the coefficient functions
- Distributed support vector machine in master-slave mode
- scientific article; zbMATH DE number 1046042 (Why is no real title available?)
- Proximal splitting methods in signal processing
- A proximal subgradient projection algorithm for linearly constrained strictly convex problems
- OSQP: an operator splitting solver for quadratic programs
- Conic optimization via operator splitting and homogeneous self-dual embedding
- The generalized proximal point algorithm with step size 2 is not necessarily convergent
- An alternating direction method for solving convex nonlinear semidefinite programming problems
- A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming
- A parallel splitting ALM-based algorithm for separable convex programming
- An ADMM-based interior-point method for large-scale linear programming
- Linearized generalized ADMM-based algorithm for multi-block linearly constrained separable convex programming in real-world applications
- Low complexity regularization of linear inverse 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
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- On the asymptotic linear convergence speed of Anderson acceleration applied to ADMM
- Projective method of multipliers for linearly constrained convex minimization
This page was built for publication: Parallel alternating direction multiplier decomposition of convex programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1321443)
