GMRES-Accelerated ADMM for Quadratic Objectives
From MaRDI portal
Publication:4554067
DOI10.1137/16M1059941zbMath1402.49025arXiv1601.06200OpenAlexW3105492150MaRDI QIDQ4554067
Publication date: 7 November 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.06200
ADMMGMRESaugmented LagrangianKrylov subspacemethod of multipliersalternating directionsequence acceleration
Semidefinite programming (90C22) Large-scale problems in mathematical programming (90C06) Newton-type methods (49M15) Numerical methods of relaxation type (49M20) Acceleration of convergence in numerical analysis (65B99)
Related Items
Fast and stable nonconvex constrained distributed optimization: the ELLADA algorithm, Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion, On the asymptotic linear convergence speed of Anderson acceleration applied to ADMM
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Matrix-free interior point method
- Alternating direction augmented Lagrangian methods for semidefinite programming
- A new polynomial-time algorithm for linear programming
- Bounds for iterates, inverses, spectral variation and fields of values of non-normal matrices
- Smoothing technique and its applications in semidefinite optimization
- On measures of nonnormality of matrices
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Minimum residual methods for augmented systems
- Complementarity and nondegeneracy in semidefinite programming
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Introductory lectures on convex optimization. A basic course.
- Optimization of the Hermitian and skew-Hermitian splitting iteration for saddle-point problems
- Block triangular preconditioners for symmetric saddle-point problems
- Preconditioning indefinite systems in interior point methods for optimization
- A primal-dual potential reduction method for problems involving matrix inequalities
- A first-order primal-dual algorithm for convex problems with applications to imaging
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs
- On the global and linear convergence of the generalized alternating direction method of multipliers
- On the eigenvalues of a class of saddle point matrices
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- Analysis of iterative methods for saddle point problems: a unified approach
- Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Unified analysis of preconditioning methods for saddle point matrices
- Optimal Parameter Selection for the Alternating Direction Method of Multipliers (ADMM): Quadratic Problems
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Anderson Acceleration for Fixed-Point Iterations
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- Numerical solution of saddle point problems
- Sampling from large matrices
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- A Preconditioning Technique for Indefinite Systems Resulting from Mixed Approximations of Elliptic Problems
- Extremal Polynomials with Application to Richardson Iteration for Indefinite Linear Systems
- A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
- A Preconditioned Iterative Method for Saddlepoint Problems
- From Potential Theory to Matrix Iterations in Six Steps
- Convergence Theory of Nonlinear Newton–Krylov Algorithms
- On Solving Block-Structured Indefinite Linear Systems
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- SDPLIB 1.2, a library of semidefinite programming test problems
- Constraint Preconditioning for Indefinite Linear Systems
- Uncertainty principles and ideal atomic decomposition
- A Preconditioner for Generalized Saddle Point Problems
- Spectral Properties of the Hermitian and Skew-Hermitian Splitting Preconditioner for Saddle Point Problems
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- Incomplete Cholesky Factorizations with Limited Memory
- Semidefinite Programming
- A Matrix-Free Preconditioner for Sparse Symmetric Positive Definite Systems and Least-Squares Problems
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Fast Alternating Direction Optimization Methods
- An Accelerated Linearized Alternating Direction Method of Multipliers
- Logarithmic barriers for sparse matrix cones
- Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions
- Covariance selection for nonchordal graphs via chordal embedding
