Approximate ADMM algorithms derived from Lagrangian splitting
type: Item
instance of: scholarly article
title: Approximate ADMM algorithms derived from Lagrangian splitting
zbMATH Open document ID: 1378.90063
author: Peng Zhang
published in: Computational Optimization and Applications
publication date: 2017-12-22T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 49M27
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 6821271
zbMATH Keywords: alternating direction method of multipliers
zbMATH Keywords: convex programming
zbMATH Keywords: decomposition methods
describes a project that uses: ALGENCAN
describes a project that uses: UCI-ml
describes a project that uses: L-BFGS
MaRDI profile type: Publication
full work available at URL: s10589-017-9911-z
OpenAlex ID: W2606768527
cites work: A note on Fejér-monotone sequences in product spaces and its applications to the dual convergence of augmented Lagrangian methods
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Practical Augmented Lagrangian Methods for Constrained Optimization
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
cites work: Finding predictive gene groups from microarray data
cites work: A practical general approximation criterion for methods of multipliers based on Bregman distances
cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
cites work: A practical relative error criterion for augmented Lagrangians
cites work: Q3093324
cites work: Q3953098
cites work: Inexact implicit methods for monotone general variational inequalities
cites work: A new inexact alternating directions method for monotone variational inequalities
cites work: A Barzilai-Borwein type method for minimizing composite functions
cites work: Q4704621
cites work: On the limited memory BFGS method for large scale optimization
cites work: Q4864293
cites work: Q5491447
cites work: Q3491338
cites work: Local boundedness of nonlinear, monotone operators
cites work: Convex Analysis
cites work: Q4050397
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: The improvement with relative errors of He et al.'s inexact alternating direction method for monotone variational inequalities
DOI: 10.1007/S10589-017-9911-Z
Recommended article: Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
Recommended article: Efficient semidefinite programming with approximate ADMM
Recommended article: Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
Recommended article: On the optimal proximal parameter of an ADMM-like splitting method for separable convex programming
Recommended article: Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms
Recommended article: Q2987354
Recommended article: Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM
Recommended article: Q3126807
Recommended article: Fixing and extending some recent results on the ADMM algorithm
Recommended article: An adaptive alternating direction method of multipliers
description: scientific article; zbMATH DE number 6821271