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

DOI10.1007/S10957-023-02199-ZMaRDI QIDQ6596346FDOQ6596346

Authors: Hadi Abbaszadehpeivasti, E. de Klerk, Moslem Zamani 

Publication date: 2 September 2024

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

semidefinite programmingperformance estimationconvex-concave proceduredifference-of-convex problemsworst-case convergence

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Semidefinite programming (90C22)

Cites Work

• Variations and extension of the convex-concave procedure
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• DC programming: overview.
• First-order methods in optimization
• Convex Analysis
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
• 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
• A duality principle for non-convex optimisation and the calculus of variations
• Convex analysis and global optimization
• A production-transportation problem with stochastic demand and concave production costs
• Performance of first-order methods for smooth convex minimization: a novel approach
• Smooth strongly convex interpolation and exact worst-case performance of first-order methods
• Margin maximization in spherical separation
• Solution of the multisource Weber and conditional Weber problems by d. -c. programming
• A weighted difference of anisotropic and isotropic total variation model for image processing
• A New Decomposition Method for Multiuser DC-Programming and Its Applications
• 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
• Exact worst-case performance of first-order methods for composite convex optimization
• Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
• DCA based algorithms for feature selection in multi-class support vector machine
• From error bounds to the complexity of first-order descent methods for convex functions
• Computing B-stationary points of nonsmooth DC programs
• Lectures on convex optimization
• DC programming and DCA: thirty years of developments
• Double bundle method for finding Clarke stationary points in nonsmooth DC programming
• DC formulations and algorithms for sparse optimization problems
• 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 decomposition of nonconvex polynomials with algebraic techniques
• Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
• Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
• 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
• Conditions for linear convergence of the gradient method for non-convex optimization
• The exact worst-case convergence rate of the gradient method with fixed step lengths for \(L\)-smooth functions

Cited In (3)

• Interpolation conditions for linear operators and applications to performance estimation problems
• Learning graph Laplacian with MCP
• A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs

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)