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