Linearized symmetric multi-block ADMM with indefinite proximal regularization and optimal proximal parameter
From MaRDI portal
Publication:831269
DOI10.1007/s10092-020-00387-1zbMath1467.65061OpenAlexW3095129419MaRDI QIDQ831269
Dunjiang Song, Jianchao Bai, Xiaokai Chang, San-Yang Liu
Publication date: 11 May 2021
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10092-020-00387-1
complexityglobal convergenceconvex programmingalternating direction method of multipliersindefinite proximal termlinearized techniqueprediction-correction
Convex programming (90C25) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)
Related Items (4)
Accelerated stochastic Peaceman-Rachford method for empirical risk minimization ⋮ A Round Trip Time Weighting Model for One-way Delay Estimation ⋮ A projected extrapolated gradient method with larger step size for monotone variational inequalities ⋮ An inexact ADMM with proximal-indefinite term and larger stepsize
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- An algorithm twisted from generalized ADMM for multi-block separable convex minimization models
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- A class of ADMM-based algorithms for three-block separable convex programming
- Convergence analysis of the direct extension of ADMM for multiple-block separable convex minimization
- Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Parallel alternating direction multiplier decomposition of convex programs
- Linearized alternating direction method of multipliers for sparse group and fused Lasso models
- Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization
- Convergent prediction-correction-based ADMM for multi-block separable convex programming
- Generalized symmetric ADMM for separable convex optimization
- Optimally linearizing the alternating direction method of multipliers for convex programming
- Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
- A partial splitting augmented Lagrangian method for low patch-rank image decomposition
- On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
- On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM
- Alternating proximal gradient method for convex minimization
- A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming
- A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Robust principal component analysis?
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- A splitting method for separable convex programming
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
- Convex Analysis
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
This page was built for publication: Linearized symmetric multi-block ADMM with indefinite proximal regularization and optimal proximal parameter
