Contractive difference-of-convex algorithms

DOI10.1007/S10957-025-02689-2MaRDI QIDQ6971095zbMATH OpenFDO

Authors Songnian He, Qiao-Li Dong, Michael Th. Rassias

Publication date 17 June 2025

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

Full work available at URL https://doi.org/10.1007/S10957-025-02689-2

zbMATH Keywords

contractive difference-of-convex algorithmdifference-of-convex optimization problemKurdyka-Łojasiewicz propertylinearized proximal method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Cites work

• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A general double-proximal gradient algorithm for d.c. programming
• A New Decomposition Method for Multiuser DC-Programming and Its Applications
• 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
• A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
• Averaged mappings and the gradient-projection algorithm
• Computing B-stationary points of nonsmooth DC programs
• Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems
• Convex Analysis
• Convex analysis and global optimization
• Convex analysis and monotone operator theory in Hilbert spaces
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• DC formulations and algorithms for sparse optimization problems
• DC programming and DCA: thirty years of developments
• Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
• Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
• Fast L1-L2 minimization via a proximal operator
• scientific article; zbMATH DE number 4041643 (Why is no real title available?)
• scientific article; zbMATH DE number 2076851 (Why is no real title available?)
• iPiano: inertial proximal algorithm for nonconvex optimization
• MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications
• Minimization of \(\ell_{1-2}\) for compressed sensing
• Minimizing the difference of convex and weakly convex functions via bundle method
• Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
• Open issues and recent advances in DC programming and DCA
• Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression
• 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 modified second APG method for DC optimization problems

Cited in

(1)

• Two-step inertial proximal difference-of-convex algorithm

This page was built for publication: Contractive difference-of-convex algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6971095)