A general double-proximal gradient algorithm for d.c. programming
From MaRDI portal
Abstract: The possibilities of exploiting the special structure of d.c. programs, which consist of optimizing the difference of convex functions, are currently more or less limited to variants of the DCA proposed by Pham Dinh Tao and Le Thi Hoai An in 1997. These assume that either the convex or the concave part, or both, are evaluated by one of their subgradients. In this paper we propose an algorithm which allows the evaluation of both the concave and the convex part by their proximal points. Additionally, we allow a smooth part, which is evaluated via its gradient. In the spirit of primal-dual splitting algorithms, the concave part might be the composition of a concave function with a linear operator, which are, however, evaluated separately. For this algorithm we show that every cluster point is a solution of the optimization problem. Furthermore, we show the connection to the Toland dual problem and prove a descent property for the objective function values of a primal-dual formulation of the problem. Convergence of the iterates is shown if this objective function satisfies the Kurdyka--L ojasiewicz property. In the last part, we apply the algorithm to an image processing model.
Recommendations
- Double-inertial proximal gradient algorithm for difference-of-convex programming
- A proximal difference-of-convex algorithm with extrapolation
- An inertial algorithm for DC programming
- New Bregman proximal type algoritms for solving DC optimization problems
- An accelerated proximal algorithm for the difference of convex programming
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 5564096 (Why is no real title available?)
- scientific article; zbMATH DE number 2076851 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A duality principle for non-convex optimisation and the calculus of variations
- A fast dual proximal gradient algorithm for convex minimization and applications
- A weighted difference of anisotropic and isotropic total variation model for image processing
- Accelerating the DC algorithm for smooth functions
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Computing B-stationary points of nonsmooth DC programs
- Convergence analysis for a primal-dual monotone + skew splitting algorithm with applications to total variation minimization
- Convergence analysis of a proximal point algorithm for minimizing differences of functions
- Convergence of New Inertial Proximal Methods for DC Programming
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming: overview.
- DCA based algorithms for feature selection in multi-class support vector machine
- Duality in nonconvex optimization
- Introductory lectures on convex optimization. A basic course.
- On gradients of functions definable in o-minimal structures
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Some methods of speeding up the convergence of iteration methods
- Some sharp performance bounds for least squares regression with L₁ regularization
- Variational Analysis
- iPiano: inertial proximal algorithm for nonconvex optimization
Cited in
(31)- A single-loop proximal subgradient algorithm for A class structured fractional programs
- The ABC of DC programming
- Variational models for color image correction inspired by visual perception and neuroscience
- On the forward-backward method with nonmonotone linesearch for infinite-dimensional nonsmooth nonconvex problems
- An accelerated double-proximal gradient algorithm for DC programming
- Contractive difference-of-convex algorithms
- A unified Douglas-Rachford algorithm for generalized DC programming
- A proximal difference-of-convex algorithm with extrapolation
- Improving ADMMs for solving doubly nonnegative programs through dual factorization
- A refined inertial DC algorithm for DC programming
- Double-inertial proximal gradient algorithm for difference-of-convex programming
- Calculus rules of the generalized concave Kurdyka-Łojasiewicz property
- The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property
- An extension of the proximal point algorithm beyond convexity
- Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems
- A bundle method for nonsmooth DC programming with application to chance-constrained problems
- An inertial algorithm for DC programming
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
- Extra-gradient linearized algorithms and Tseng's linearized algorithm for the split DC programming
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- Two-step inertial proximal difference-of-convex algorithm
- A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging
- Full splitting algorithms for fractional programs with structured numerators and denominators
- The boosted double-proximal subgradient algorithm for nonconvex optimization
- Split proximal linearized algorithm and convergence theorems for the split DC program
- Algorithms for structured sparsity promoting functions regularized image restoration model
- A proximal splitting algorithm for generalized DC programming with applications in signal recovery
- General inertial proximal DC algorithm for three block nonsmooth DC optimization problems
- A multi-step inertial Bregman proximal DC algorithm and its application to solving some inverse problems
- Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
This page was built for publication: A general double-proximal gradient algorithm for d.c. programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2330650)
