Convergence of ADMM for multi-block nonconvex separable optimization models
type: Item
instance of: scholarly article
title: Convergence of ADMM for multi-block nonconvex separable optimization models
zbMATH Open document ID: 1386.90114
author: Ke Guo
author: Deren Han
author: David Z. W. Wang
author: Tingting Wu
published in: Frontiers of Mathematics in China
publication date: 2018-01-19T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 49J52
Mathematics Subject Classification ID: 49M27
zbMATH DE Number: 6827759
zbMATH Keywords: nonconvex optimization
zbMATH Keywords: separable structure
zbMATH Keywords: alternating direction method of multipliers (ADMM)
zbMATH Keywords: Kurdyka-Lojasiewicz inequality
MaRDI profile type: Publication
full work available at URL: s11464-017-0631-6
OpenAlex ID: W2588594937
cites work: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
cites work: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
cites work: Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs
cites work: The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
cites work: Clarke Subgradients of Stratifiable Functions
cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems
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: The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation
cites work: Q4144736
cites work: Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
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: An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
cites work: Alternating direction method with Gaussian back substitution for separable convex programming
cites work: Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming
cites work: On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
cites work: Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
cites work: On gradients of functions definable in o-minimal structures
cites work: Global Convergence of Splitting Methods for Nonconvex Composite Optimization
cites work: A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block
cites work: Q5643297
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Variational Analysis
cites work: Alternating direction methods for classical and ptychographic phase retrieval
cites work: Linear convergence of the alternating direction method of multipliers for a class of convex optimization problems
DOI: 10.1007/S11464-017-0631-6
description: scientific article; zbMATH DE number 6827759