On the rate of convergence of the difference-of-convex algorithm (DCA)
From MaRDI portal
Publication:6596346
Recommendations
- Convergence rate analysis of the proximal difference of the convex algorithm
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- An accelerated proximal algorithm for the difference of convex programming
- Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity
- A proximal difference-of-convex algorithm with extrapolation
Cites work
- A New Decomposition Method for Multiuser DC-Programming and Its Applications
- A duality principle for non-convex optimisation and the calculus of variations
- A production-transportation problem with stochastic demand and concave production costs
- A weighted difference of anisotropic and isotropic total variation model for image processing
- Computing B-stationary points of nonsmooth DC programs
- Conditional gradient type methods for composite nonlinear and stochastic optimization
- Conditions for linear convergence of the gradient method for non-convex optimization
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- Convex Analysis
- Convex analysis and global optimization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC decomposition of nonconvex polynomials with algebraic techniques
- DC formulations and algorithms for sparse optimization problems
- DC programming and DCA: thirty years of developments
- DC programming: overview.
- DCA based algorithms for feature selection in multi-class support vector machine
- Double bundle method for finding Clarke stationary points in nonsmooth DC programming
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- Exact worst-case performance of first-order methods for composite convex optimization
- First-order methods in optimization
- From error bounds to the complexity of first-order descent methods for convex functions
- Lectures on convex optimization
- Margin maximization in spherical separation
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- On functions representable as a difference of convex functions
- On the expressibility of piecewise-linear continuous functions as the difference of two piecewise-linear convex functions
- On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
- Performance of first-order methods for smooth convex minimization: a novel approach
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods
- Solution of the multisource Weber and conditional Weber problems by d. -c. programming
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- The exact worst-case convergence rate of the gradient method with fixed step lengths for \(L\)-smooth functions
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Variations and extension of the convex-concave procedure
- Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation
Cited in
(3)
This page was built for publication: On the rate of convergence of the difference-of-convex algorithm (DCA)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6596346)
