Convergence study of indefinite proximal ADMM with a relaxation factor
type: Item
instance of: scholarly article
title: Convergence study of indefinite proximal ADMM with a relaxation factor
zbMATH Open document ID: 1447.90033
author: Min Tao
published in: Computational Optimization and Applications
publication date: 2020-07-29T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 7225618
zbMATH Keywords: convex programming
zbMATH Keywords: alternating direction method of multipliers
zbMATH Keywords: proximal alternating direction method of multipliers
zbMATH Keywords: step size
zbMATH Keywords: convergence
describes a project that uses: PDCO
MaRDI profile type: Publication
full work available at URL: s10589-020-00206-x
OpenAlex ID: W3036274128
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: A first-order primal-dual algorithm for convex problems with applications to imaging
cites work: Linearized Alternating Direction Method of Multipliers for Constrained Linear Least-Squares Problem
cites work: Constrained total variation deblurring models and fast algorithms based on alternating direction method of multipliers
cites work: Atomic decomposition by basis pursuit
cites work: Convergence analysis of positive-indefinite proximal ADMM with a Glowinski's relaxation factor
cites work: On the global and linear convergence of the generalized alternating direction method of multipliers
cites work: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
cites work: Q4311908
cites work: Q3466913
cites work: Hankel matrix rank minimization with applications to system identification and realization
cites work: Q3038523
cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation
cites work: Q3694624
cites work: On Alternating Direction Methods of Multipliers: A Historical Perspective
cites work: Q4144736
cites work: A new inexact alternating directions method for monotone variational inequalities
cites work: Optimally linearizing the alternating direction method of multipliers for convex programming
cites work: Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems
cites work: Navigating in a Graph by Aid of Its Spanning Tree Metric
cites work: Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
cites work: A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization
cites work: Convex Analysis
cites work: A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
cites work: Q4864293
cites work: Alternating direction augmented Lagrangian methods for semidefinite programming
cites work: Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
cites work: On Glowinski's open question on the alternating direction method of multipliers
cites work: Proximal alternating directions method for structured variational inequalities
DOI: 10.1007/S10589-020-00206-X
description: scientific article; zbMATH DE number 7225618