A refined inertial DC algorithm for DC programming

DOI10.1007/S11081-022-09716-5zbMATH Open1514.90194arXiv2104.14750OpenAlexW4226155457MaRDI QIDQ6159465FDOQ6159465

Authors: Yu You, Yi-Shuai Niu 

Publication date: 20 June 2023

Published in: Optimization and Engineering (Search for Journal in Brave)

Abstract: In this paper we consider the difference-of-convex (DC) programming problems, whose objective function is the difference of two convex functions. The classical DC Algorithm (DCA) is well-known for solving this kind of problems, which generally returns a critical point. Recently, an inertial DC algorithm (InDCA) equipped with heavy-ball inertial-force procedure was proposed in de Oliveira et al. (Set-Valued and Variational Analysis 27(4):895--919, 2019), which potentially helps to improve both the convergence speed and the solution quality. Based on InDCA, we propose a refined inertial DC algorithm (RInDCA) equipped with enlarged inertial step-size compared with InDCA. Empirically, larger step-size accelerates the convergence. We demonstrate the subsequential convergence of our refined version to a critical point. In addition, by assuming the Kurdyka-{L}ojasiewicz (KL) property of the objective function, we establish the sequential convergence of RInDCA. Numerical simulations on checking copositivity of matrices and image denoising problem show the benefit of larger step-size.

Full work available at URL: https://arxiv.org/abs/2104.14750

Recommendations

• An inertial algorithm for DC programming
• Double-inertial proximal gradient algorithm for difference-of-convex programming
• Alternating DC algorithm for partial DC programming problems
• A general double-proximal gradient algorithm for d.c. programming
• New Bregman proximal type algoritms for solving DC optimization problems

zbMATH Keywords

image denoisingdifference-of-convex programmingKurdyka-Łojasiewicz propertychecking copositivity of matricesrefined inertial DC algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Computing methodologies for image processing (68U10)

Cites Work

• iPiano: inertial proximal algorithm for nonconvex optimization
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• DC programming: overview.
• Gradient methods for minimizing composite functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• First-order methods in optimization
• Convex Analysis
• Title not available (Why is that?)
• Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Exact penalty and error bounds in DC programming
• Global convergence of a proximal linearized algorithm for difference of convex functions
• Testing copositivity with the help of difference-of-convex optimization
• Heavy-ball method in nonconvex optimization problems
• On functions representable as a difference of convex functions
• Computing B-stationary points of nonsmooth DC programs
• Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
• Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization
• DC programming and DCA: thirty years of developments
• Accelerating the DC algorithm for smooth functions
• An inertial algorithm for DC programming
• A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
• The ABC of DC programming
• On the surfaces representable as difference of convex functions
• A proximal difference-of-convex algorithm with extrapolation
• Alternating DC algorithm for partial DC programming problems
• The boosted DC algorithm for linearly constrained DC programming
• A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
• Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization

Cited In (5)

• Preface to the special issue dedicated to the 6th world congress on global optimization held in Metz, France, July 8--10, 2019
• Double-inertial proximal gradient algorithm for difference-of-convex programming
• An inertial algorithm for DC programming
• A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program
• A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs

This page was built for publication: A refined inertial DC algorithm for DC programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6159465)