An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems
type: Item
instance of: scholarly article
title: An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems
zbMATH Open document ID: 1502.90126
author: Fan Jiang
author: Zhongming Wu
published in: Journal of Computational and Applied Mathematics
publication date: 2022-10-06T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7596841
zbMATH Keywords: alternating direction method of multipliers
zbMATH Keywords: symmetric
zbMATH Keywords: inexactness
zbMATH Keywords: relative error criteria
zbMATH Keywords: indefinite proximal term
describes a project that uses: GADMM
describes a project that uses: PDCO
MaRDI profile type: Publication
full work available at URL: j.cam.2022.114628
OpenAlex ID: W4288070108
Wikidata QID: Q113878685
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Exact matrix completion via convex optimization
cites work: Atomic decomposition by basis pursuit
cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
cites work: Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation
cites work: Q4144736
cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
cites work: A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
cites work: Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
cites work: Generalized symmetric ADMM for separable convex optimization
cites work: An LQP-based symmetric alternating direction method of multipliers with larger step sizes
cites work: The developments of proximal point algorithms
cites work: \(O(1/t)\) complexity analysis of the generalized alternating direction method of multipliers
cites work: Symmetric Gauss-Seidel technique-based alternating direction methods of multipliers for transform invariant low-rank textures problem
cites work: A survey on some recent developments of alternating direction method of multipliers
cites work: Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
cites work: A note on the alternating direction method of multipliers
cites work: Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
cites work: A proximal Peaceman–Rachford splitting method for solving the multi-block separable convex minimization problems
cites work: An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems
cites work: Linear convergence of the alternating direction method of multipliers for a class of convex optimization problems
cites work: A new inexact alternating directions method for monotone variational inequalities
cites work: Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
cites work: Generalized alternating direction method of multipliers: new theoretical insights and applications
cites work: A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging
cites work: Optimally linearizing the alternating direction method of multipliers for convex programming
cites work: A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization
cites work: A linearly convergent majorized ADMM with indefinite proximal terms for convex composite programming and its applications
cites work: The indefinite proximal point algorithms for maximal monotone operators
cites work: Convergence analysis of positive-indefinite proximal ADMM with a Glowinski's relaxation factor
cites work: Convergence study of indefinite proximal ADMM with a relaxation factor
cites work: Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization
cites work: Inertial proximal strictly contractive peaceman-Rachford splitting method with an indefinite term for convex optimization
cites work: An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
cites work: Approximate ADMM algorithms derived from Lagrangian splitting
cites work: A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
cites work: An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
cites work: An inexact alternating direction method of multipliers with relative error criteria
cites work: On inexact ADMMs with relative error criteria
cites work: Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
cites work: Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming
cites work: Q5491447
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: Nonlinear total variation based noise removal algorithms
cites work: Some projection methods with the BB step sizes for variational inequalities
DOI: 10.1016/J.CAM.2022.114628
description: scientific article; zbMATH DE number 7596841