An extragradient-based alternating direction method for convex minimization
From MaRDI portal
Publication:525598
DOI10.1007/s10208-015-9282-8zbMath1364.90259arXiv1301.6308OpenAlexW1913585168MaRDI QIDQ525598
Shu-Zhong Zhang, Tian-Yi Lin, Shi-Qian Ma
Publication date: 5 May 2017
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.6308
Linear regression; mixed models (62J05) Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25)
Related Items
On inexact stochastic splitting methods for a class of nonconvex composite optimization problems with relative error, Iteration-complexity analysis of a generalized alternating direction method of multipliers, A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization, Alternating proximal gradient method for convex minimization, On the information-adaptive variants of the ADMM: an iteration complexity perspective, Operator Splitting Performance Estimation: Tight Contraction Factors and Optimal Parameter Selection, A double extrapolation primal-dual algorithm for saddle point problems, Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers, A unified convergence analysis of stochastic Bregman proximal gradient and extragradient methods, A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization, On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM, On the pointwise iteration-complexity of a dynamic regularized ADMM with over-relaxation stepsize, Unnamed Item
Uses Software
Cites Work
- 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
- Sparse inverse covariance estimation with the graphical lasso
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Parallel coordinate descent methods for big data optimization
- A practical relative error criterion for augmented Lagrangians
- Alternating direction method of multipliers for sparse principal component analysis
- Fixed point and Bregman iterative methods for matrix rank minimization
- Alternating direction augmented Lagrangian methods for semidefinite programming
- On the sublinear convergence rate of multi-block ADMM
- Split Bregman method for large scale fused Lasso
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- A new inexact alternating directions method for monotone variational inequalities
- On the information-adaptive variants of the ADMM: an iteration complexity perspective
- New extragradient-type methods for general variational inequalities.
- Path-following gradient-based decomposition algorithms for separable convex optimization
- Alternating direction method for covariance selection models
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Robust principal component analysis?
- On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
- Rank-Sparsity Incoherence for Matrix Decomposition
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- An alternating extragradient method for total variation-based image restoration from Poisson data
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- The Split Bregman Method for L1-Regularized Problems
- Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Model selection and estimation in the Gaussian graphical model
- Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Sparsity and Smoothness Via the Fused Lasso
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Application of a Smoothing Technique to Decomposition in Convex Optimization
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
