An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications

DOI10.1016/j.cam.2022.114821zbMath1504.90103OpenAlexW4294739471WikidataQ114201619 ScholiaQ114201619MaRDI QIDQ2087522

Xiaoquan Wang, Pengjie Liu, Ting Wu, Hu Shao

Publication date: 21 October 2022

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2022.114821

zbMATH Keywords

global convergencealternating direction method of multipliersKurdyka-Łojasiewicz propertyinertial proximal point methodlinearly constrained multi-block nonconvex optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items

A family of three-term conjugate gradient projection methods with a restart procedure and their relaxed-inertial extensions for the constrained nonlinear pseudo-monotone equations with applications

Uses Software

• iPiano
• iPiasco
• BADMM

Cites Work

• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Nonlinear total variation based noise removal algorithms
• Inertial Douglas-Rachford splitting for monotone inclusion problems
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• iPiasco: inertial proximal algorithm for strongly convex optimization
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Convergence of ADMM for multi-block nonconvex separable optimization models
• Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
• Global convergence of ADMM in nonconvex nonsmooth optimization
• Generalized symmetric ADMM for separable convex optimization
• The convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problems
• An effective alternating direction method of multipliers for color image restoration
• Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
• An extended proximal ADMM algorithm for three-block nonconvex optimization problems
• An inexact accelerated stochastic ADMM for separable convex optimization
• A survey on some recent developments of alternating direction method of multipliers
• A partially proximal S-ADMM for separable convex optimization with linear constraints
• Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property
• A multi-parameter parallel ADMM for multi-block linearly constrained separable convex optimization
• A primal-dual multiplier method for total variation image restoration
• A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
• General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
• Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming
• A sequential updating scheme of the Lagrange multiplier for separable convex programming
• iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
• A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
• Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
• Outlier-Robust PCA: The High-Dimensional Case
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
• Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
• Variational Analysis
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
• Convergence of the Peaceman-Rachford Splitting Method for a Class of Nonconvex Programs
• An inertial proximal alternating direction method of multipliers for nonconvex optimization
• An inertial proximal Peaceman-Rachford splitting method
• The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
• Comments on «Wavelets in statistics: A review» by A. Antoniadis
• A Linearized Alternating Direction Method of Multipliers with Substitution Procedure
• Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
• Some methods of speeding up the convergence of iteration methods
• Heavy-ball method in nonconvex optimization problems