On the rate of convergence of the difference-of-convex algorithm (DCA)

Cites Work

Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Smooth strongly convex interpolation and exact worst-case performance of first-order methods
DCA based algorithms for feature selection in multi-class support vector machine
Lectures on convex optimization
On functions representable as a difference of convex functions
A duality principle for non-convex optimisation and the calculus of variations
A production-transportation problem with stochastic demand and concave production costs
Convex analysis approach to d. c. programming: Theory, algorithms and applications
From error bounds to the complexity of first-order descent methods for convex functions
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
Conditional gradient type methods for composite nonlinear and stochastic optimization
Convergence analysis of difference-of-convex algorithm with subanalytic data
DC programming and DCA: thirty years of developments
DC decomposition of nonconvex polynomials with algebraic techniques
DC formulations and algorithms for sparse optimization problems
The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
Margin maximization in spherical separation
DC programming: overview.
Performance of first-order methods for smooth convex minimization: a novel approach
Variations and extension of the convex-concave procedure
Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
The exact worst-case convergence rate of the gradient method with fixed step lengths for \(L\)-smooth functions
Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming
Computing B-Stationary Points of Nonsmooth DC Programs
On the expressibility of piecewise-linear continuous functions as the difference of two piecewise-linear convex functions
A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing
Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
A New Decomposition Method for Multiuser DC-Programming and Its Applications
First-Order Methods in Optimization
Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation
Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming
Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization
The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
Convex Analysis
Convex analysis and global optimization
Conditions for linear convergence of the gradient method for non-convex optimization