A full splitting algorithm for structured difference-of-convex programs

DOI10.1016/J.APNUM.2026.02.019MaRDI QIDQ7299593zbMATH OpenFDO

Authors Radu I. Boţ, Rossen Nenov, Min Tao

Publication date 20 July 2026

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.APNUM.2026.02.019

Mathematics Subject Classification ID

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

Cites work

• A general double-proximal gradient algorithm for d.c. programming
• A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
• A refined inertial DC algorithm for DC programming
• A weighted difference of anisotropic and isotropic total variation model for image processing
• Accelerating the DC algorithm for smooth functions
• Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
• Characterization of metric regularity of subdifferentials
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Convex analysis and monotone operator theory in Hilbert spaces
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• DC programming and DCA: thirty years of developments
• DCA based algorithms for feature selection in multi-class support vector machine
• Double bundle method for finding Clarke stationary points in nonsmooth DC programming
• ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES
• Full splitting algorithms for fractional programs with structured numerators and denominators
• Gabor analysis and algorithms. Theory and applications
• Global convergence of splitting methods for nonconvex composite optimization
• scientific article; zbMATH DE number 5564096 (Why is no real title available?)
• scientific article; zbMATH DE number 2076851 (Why is no real title available?)
• Inexact proximal DC Newton-type method for nonconvex composite functions
• iPiano: inertial proximal algorithm for nonconvex optimization
• Minimization of functions having Lipschitz continuous first partial derivatives
• Minimizing compositions of differences-of-convex functions with smooth mappings
• Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Proximal bundle methods for nonsmooth DC programming
• Ratio and difference of \(l_1\) and \(l_2\) norms and sparse representation with coherent dictionaries
• Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
• Sequential difference-of-convex programming
• The boosted DC algorithm for linearly constrained DC programming
• The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
• Variable smoothing for convex optimization problems using stochastic gradients
• Variational Analysis

This page was built for publication: A full splitting algorithm for structured difference-of-convex programs

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