Alternating proximal gradient method for convex minimization
From MaRDI portal
Publication:2399191
DOI10.1007/s10915-015-0150-0zbMath1371.65056OpenAlexW2217484818MaRDI QIDQ2399191
Publication date: 22 August 2017
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-015-0150-0
global convergencelinear constraintsconvex minimizationnumerical resultalternating direction method of multipliersproximal gradient methodsparse and low-rank optimization
Related Items
General parameterized proximal point algorithm with applications in statistical learning ⋮ Linearized symmetric multi-block ADMM with indefinite proximal regularization and optimal proximal parameter ⋮ Hybrid regularized cone-beam reconstruction for axially symmetric object tomography ⋮ Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming ⋮ A generalized inexact Uzawa method for stable principal component pursuit problem with nonnegative constraints ⋮ Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists ⋮ A proximal alternating linearization method for minimizing the sum of two convex functions ⋮ A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming ⋮ Convergence study on the proximal alternating direction method with larger step size ⋮ Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization ⋮ Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection ⋮ A modified strictly contractive peaceman-Rachford splitting method for multi-block separable convex programming ⋮ Linearized block-wise alternating direction method of multipliers for multiple-block convex programming ⋮ Sensitivity analysis of the proximal-based parallel decomposition methods ⋮ An implementable first-order primal-dual algorithm for structured convex optimization ⋮ A linearized Peaceman-Rachford splitting method for structured convex optimization with application to stable principal component pursuit ⋮ Convergence of the augmented decomposition algorithm ⋮ Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit ⋮ On the linear convergence of the alternating direction method of multipliers ⋮ Generalized symmetric ADMM for separable convex optimization ⋮ Improved proximal ADMM with partially parallel splitting for multi-block separable convex programming ⋮ A class of customized proximal point algorithms for linearly constrained convex optimization ⋮ Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems ⋮ A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization ⋮ Sparse high-dimensional semi-nonparametric quantile regression in a reproducing kernel Hilbert space ⋮ Efficient and Convergent Preconditioned ADMM for the Potts Models ⋮ Discrete Total Variation: New Definition and Minimization ⋮ Converting ADMM to a proximal gradient for efficient sparse estimation ⋮ An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems ⋮ A customized proximal point algorithm for stable principal component pursuit with nonnegative constraint ⋮ Convergence analysis of L-ADMM for multi-block linear-constrained separable convex minimization problem
Uses Software
Cites Work
- 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
- Sparse inverse covariance estimation with the graphical lasso
- Latent variable graphical model selection via convex optimization
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Alternating direction method of multipliers for sparse principal component analysis
- An alternating direction method with increasing penalty for stable principal component pursuit
- An extragradient-based alternating direction method for convex minimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- Alternating direction augmented Lagrangian methods for semidefinite programming
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- On the sublinear convergence rate of multi-block ADMM
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A proximal-based deomposition method for compositions method for convex minimization problems
- A new inexact alternating directions method for monotone variational inequalities
- Alternating direction method for covariance selection models
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Exact matrix completion via convex optimization
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- Fast Multiple-Splitting Algorithms for Convex Optimization
- An alternating direction method for total variation denoising
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Robust principal component analysis?
- A Singular Value Thresholding Algorithm for Matrix Completion
- Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm
- Rank-Sparsity Incoherence for Matrix Decomposition
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- The Split Bregman Method for L1-Regularized Problems
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization
- On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming
- Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers
- Model selection and estimation in the Gaussian graphical model
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Positive-Definite ℓ1-Penalized Estimation of Large Covariance Matrices
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Compressive principal component pursuit
- Fast Alternating Direction Optimization Methods
- Regularization Methods for Semidefinite Programming
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming
- Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
- Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
- Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs
- Signal Recovery by Proximal Forward-Backward Splitting
- On the Global Linear Convergence of the ADMM with MultiBlock Variables
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- Compressed sensing
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
