Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization
type: Item
instance of: scholarly article
title: Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization
zbMATH Open document ID: 1449.90290
author: Fan Jiang
author: Zhongming Wu
author: Xing-Ju Cai
published in: Journal of Industrial and Management Optimization
publication date: 2020-07-16T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 49M27
zbMATH DE Number: 7221679
zbMATH Keywords: generalized alternating direction method of multipliers
zbMATH Keywords: convex programming
zbMATH Keywords: convergence rate
zbMATH Keywords: indefinite proximal term
zbMATH Keywords: optimal range
describes a project that uses: UNLocBoX
describes a project that uses: GADMM
describes a project that uses: PDCO
MaRDI profile type: Publication
full work available at URL: jimo.2018181
OpenAlex ID: W2907514291
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: Exact matrix completion via convex optimization
cites work: Atomic Decomposition by Basis Pursuit
cites work: Proximal Splitting Methods in Signal Processing
cites work: Signal Recovery by Proximal Forward-Backward Splitting
cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
cites work: Q3466913
cites work: Generalized alternating direction method of multipliers: new theoretical insights and applications
cites work: Restoration of Poissonian Images Using Alternating Direction Optimization
cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation
cites work: On Alternating Direction Methods of Multipliers: A Historical Perspective
cites work: Q4144736
cites work: A new method for a class of linear variational inequalities
cites work: PPA-like contraction methods for convex optimization: a framework using variational inequality approach
cites work: A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
cites work: Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
cites work: On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
cites work: Convergence analysis of the generalized alternating direction method of multipliers with logarithmic-quadratic proximal regularization
cites work: A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization
cites work: Linearized alternating direction method of multipliers for sparse group and fused Lasso models
cites work: A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging
cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
cites work: Nonlinear total variation based noise removal algorithms
cites work: Removing multiplicative noise by Douglas-Rachford splitting methods
cites work: Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
cites work: Q4864293
cites work: Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
cites work: Alternating direction method for covariance selection models
cites work: A proximal alternating linearization method for minimizing the sum of two convex functions
Wikidata QID: Q128651345
DOI: 10.3934/JIMO.2018181
description: scientific article; zbMATH DE number 7221679