An inertial proximal splitting method with applications

ABSTRACT In this paper, we propose an inertial proximal splitting method for solving the non-convex optimization problem, and the new method employs the idea of inertial proximal point to improve the computational efficiency. Based on the assumptions that the sequence generated by the new method is bounded and the auxiliary function satisfies the Kurdyka–Łojasiewicz property, the global convergence analysis with a more relaxed parameter range is proved for the proposed method. Moreover, some numerical results on SCAD, image processing and robust PCA non-convex problems are tested to demonstrate the effectiveness and superiority of the proposed method.

• Publication year

  2023

• Venue

  Optimization

• Publication date

  2023-07-14

• Fields of study

  Not labeled

• Identifiers
  DOI 10.1080/02331934.2023.2230994
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure

  2022cited by this paper
• An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications

  2022influential reference
• Distributionally Robust Framework and its Approximations Based on Vector and Region Split for Self-Scheduling of Generation Companies

  2022cited by this paper
• A multi-parameter parallel ADMM for multi-block linearly constrained separable convex optimization

  2022cited by this paper
• A Survey on Some Recent Developments of Alternating Direction Method of Multipliers

  2022cited by this paper
• An Inexact ADMM with Proximal-indefinite Term and Larger Stepsize

  2022cited by this paper
• An inertial alternating minimization with Bregman distance for a class of nonconvex and nonsmooth problems

  2022cited by this paper
• Convergence of Bregman Peaceman–Rachford Splitting Method for Nonconvex Nonseparable Optimization

  2022cited by this paper
• Local Linear Convergence of the Alternating Direction Method of Multipliers for Nonconvex Separable Optimization Problems

  2021cited by this paper
• A survey on applications of Alternating Direction Method of Multipliers in smart power grids

  2021cited by this paper
• An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization

  2021cited by this paper
• A Distributed Dual Consensus ADMM Based on Partition for DC-DOPF With Carbon Emission Trading

  2020cited by this paper
• A Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and Beyond

  2020cited by this paper
• An effective alternating direction method of multipliers for color image restoration

  2020cited by this paper
• Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems

  2020cited by this paper
• An inertial proximal alternating direction method of multipliers for nonconvex optimization

  2020cited by this paper
• An inexact accelerated stochastic ADMM for separable convex optimization

  2020cited by this paper
• Multi-block Nonconvex Nonsmooth Proximal ADMM: Convergence and Rates Under Kurdyka–Łojasiewicz Property

  2020cited by this paper
• General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems

  2019cited by this paper
• Convergence analysis of positive-indefinite proximal ADMM with a Glowinski’s relaxation factor

  2019cited by this paper
• Convergence revisit on generalized symmetric ADMM

  2019cited by this paper
• A Gauss–Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems

  2019cited by this paper
• Correction to: A partially isochronous splitting algorithm for three-block separable convex minimization problems

  2018cited by this paper
• Convergent prediction-correction-based ADMM for multi-block separable convex programming

  2018cited by this paper
• Convergence of ADMM for multi-block nonconvex separable optimization models

  2017cited by this paper
• A partially isochronous splitting algorithm for three-block separable convex minimization problems

  2017cited by this paper
• Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints

  2017cited by this paper
• Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems

  2017cited by this paper
• Generalized symmetric ADMM for separable convex optimization

  2017cited by this paper
• Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems

  2016cited by this paper
• Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization

  2015cited by this paper
• A distributed Douglas-Rachford splitting method for multi-block convex minimization problems

  2015cited by this paper
• A proximal block minimization method of multipliers with a substitution procedure

  2015cited by this paper
• A Linearized Alternating Direction Method of Multipliers with Substitution Procedure

  2015cited by this paper
• Convergence of multi-block Bregman ADMM for nonconvex composite problems

  2015influential reference
• iPiasco: Inertial Proximal Algorithm for Strongly Convex Optimization

  2015cited by this paper
• Introductory Lectures on Convex Optimization - A Basic Course

  2014cited by this paper
• Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems

  2014cited by this paper
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

  2014cited by this paper
• iPiano: Inertial Proximal Algorithm for Nonconvex Optimization

  2014cited by this paper
• Inertial Douglas-Rachford splitting for monotone inclusion problems

  2014cited by this paper
• Global Convergence of Splitting Methods for Nonconvex Composite Optimization

  2014cited by this paper
• Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs

  2013cited by this paper
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems

  2013cited by this paper
• Outlier-Robust PCA: The High-Dimensional Case

  2013cited by this paper
• $L_{1/2}$ Regularization: A Thresholding Representation Theory and a Fast Solver

  2012cited by this paper
• On provable exact low-rank recovery in topic models

  2011cited by this paper
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz Inequality

  2008cited by this paper
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

  2003cited by this paper
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

  2001cited by this paper
• Variational Analysis

  1998cited by this paper
• Comments on «Wavelets in statistics: A review» by A. Antoniadis

  1997cited by this paper
• Heavy-ball method in nonconvex optimization problems

  1993cited by this paper
• Nonlinear total variation based noise removal algorithms

  1992cited by this paper
• Sur l'approximation, par éléments finis d'ordre un, et la résolution, par pénalisation-dualité d'une classe de problèmes de Dirichlet non linéaires

  1975cited by this paper
• A partially symmetric regularized alternating direction method of multipliers for nonconvex multi-block optimization

  year unknowncited by this paper

• A Half-Proximal Symmetric Splitting Method for Non-Convex Separable Optimization

  2025cites this paper
• Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions

  2024influential citation
• Energy scheduling for microgrids with renewable energy sources considering an adjustable convex hull based uncertainty set

  2023cites this paper
• An improved proximal alternating linearized minimization algorithm and its inertial Bregman extension for structured nonconvex nonsmooth optimization problems on Riemannian manifold

  year unknowncites this paper