Three operator splitting algorithms for solving nonsmooth DC programming problems

DOI10.12286/JSSX.J2024-1218MaRDI QIDQ6916474zbMATH OpenFDO

Authors Xiao-Nan Gao, X. J. Long

Publication date 15 October 2025

Published in Mathematica Numerica Sinica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.12286/JSSX.J2024-1218

zbMATH Keywords

convergencesplitting algorithmDC programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Cites work

• scientific article; zbMATH DE number 4041643 (Why is no real title available?)
• A proximal difference-of-convex algorithm with extrapolation
• A three-operator splitting algorithm with deviations for generalized DC programming
• A unified Douglas-Rachford algorithm for generalized DC programming
• An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming
• Convex analysis and monotone operator theory in Hilbert spaces
• D.C. programming for sparse proximal support vector machines
• DC formulations and algorithms for sparse optimization problems
• Fast L1-L2 minimization via a proximal operator
• Minimization of \(\ell_{1-2}\) for compressed sensing
• Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
• On the pervasiveness of difference-convexity in optimization and statistics

This page was built for publication: Three operator splitting algorithms for solving nonsmooth DC programming problems

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