An inexact version of the symmetric proximal ADMM for solving separable convex optimization

DOI10.1007/s11075-022-01491-9arXiv2006.02815OpenAlexW3033368844MaRDI QIDQ6175892

Max L. N. Gonçalves, V. A. Adona

Publication date: 21 August 2023

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.02815

zbMATH Keywords

convex programrelative error criterionsymmetric alternating direction method of multipliersergodic iteration-complexitypointwise iteration-complexity

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Numerical optimization and variational techniques (65K10) Monotone operators and generalizations (47H05) Decomposition methods (49M27) Numerical analysis (65-XX)

Related Items (2)

A variable projection method for large-scale inverse problems with \(\ell^1\) regularization ⋮ Accelerated stochastic Peaceman-Rachford method for empirical risk minimization

This page was built for publication: An inexact version of the symmetric proximal ADMM for solving separable convex optimization