A fundamental proof of convergence of alternating direction method of multipliers for weakly convex optimization
type: Item
instance of: scholarly article
title: A fundamental proof of convergence of alternating direction method of multipliers for weakly convex optimization
zbMATH Open document ID: 1499.90164
author: Tao Zhang
author: Zhengwei Shen
published in: Journal of Inequalities and Applications
publication date: 2022-01-19T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7459156
zbMATH Keywords: convex optimization
zbMATH Keywords: weakly convex function
zbMATH Keywords: ublinear and linear convergence
describes a project that uses: BADMM
MaRDI profile type: Publication
full work available at URL: s13660-019-2080-0
OpenAlex ID: W2946936191
cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation
cites work: Q4144736
cites work: The Douglas-Rachford algorithm in the affine-convex case
cites work: The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings
cites work: On the Convergence of the Iterative Shrinkage/Thresholding Algorithm With a Weakly Convex Penalty
cites work: Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming
cites work: Q3466913
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
cites work: Hankel matrix rank minimization with applications to system identification and realization
cites work: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
cites work: Global Convergence of Splitting Methods for Nonconvex Composite Optimization
cites work: On the Convergence of Block Coordinate Descent Type Methods
cites work: Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm
cites work: A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
cites work: Convex Analysis
cites work: Variational Analysis
cites work: On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
cites work: Fast Alternating Direction Optimization Methods
cites work: On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
cites work: Parallel multi-block ADMM with \(o(1/k)\) convergence
cites work: Linear convergence of the alternating direction method of multipliers for a class of convex optimization problems
cites work: On the global and linear convergence of the generalized alternating direction method of multipliers
cites work: Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
Wikidata QID: Q127941685
DOI: 10.1186/S13660-019-2080-0
description: scientific article; zbMATH DE number 7459156