Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization
From MaRDI portal
Publication:1706414
DOI10.1007/s10957-017-1207-zzbMath1453.65133OpenAlexW2773075392MaRDI QIDQ1706414
Publication date: 22 March 2018
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-017-1207-z
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical methods based on nonlinear programming (49M37)
Related Items
The symmetric ADMM with indefinite proximal regularization and its application ⋮ Alternating direction method of multipliers with variable metric indefinite proximal terms for convex optimization ⋮ Linearized symmetric multi-block ADMM with indefinite proximal regularization and optimal proximal parameter ⋮ Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming ⋮ Multi-step inertial strictly contractive PRSM algorithms for convex programming problems with applications ⋮ A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming ⋮ Accelerated stochastic Peaceman-Rachford method for empirical risk minimization ⋮ Convergence study on the proximal alternating direction method with larger step size ⋮ Generalized Peaceman-Rachford splitting method with substitution for convex programming ⋮ Convergence revisit on generalized symmetric ADMM ⋮ Improved proximal ADMM with partially parallel splitting for multi-block separable convex programming ⋮ Inertial proximal strictly contractive peaceman-Rachford splitting method with an indefinite term for convex optimization ⋮ An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming ⋮ An inexact ADMM with proximal-indefinite term and larger stepsize
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Nonlinear total variation based noise removal algorithms
- On maximum and variational principles via image space analysis
- On an inequality of C. Sundberg: a computational investigation via nonlinear programming
- On the linear convergence of the alternating direction method of multipliers
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Image recovery via total variation minimization and related problems
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Global convergence of ADMM in nonconvex nonsmooth optimization
- A note on the alternating direction method of multipliers
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Alternating proximal gradient method for convex minimization
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- Exact matrix completion via convex optimization
- A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization
- Splitting Methods in Communication, Imaging, Science, and Engineering
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Robust principal component analysis?
- Rank-Sparsity Incoherence for Matrix Decomposition
- Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
- A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Regression Shrinkage and Selection via The Lasso: A Retrospective
- The Linearized Alternating Direction Method of Multipliers for Dantzig Selector
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- On Alternating Direction Methods of Multipliers: A Historical Perspective
- Some Facts About Operator-Splitting and Alternating Direction Methods
- ADMM and Non-convex Variational Problems
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- On the Global Linear Convergence of the ADMM with MultiBlock Variables
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
