Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization

DOI10.1137/21m1457709OpenAlexW4391439828WikidataQ128905457 ScholiaQ128905457MaRDI QIDQ6188511

Zhe Sun, Lei Wu

Publication date: 7 February 2024

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/21m1457709

zbMATH Keywords

DCAD-stationary pointnonsmooth DC program

Mathematics Subject Classification ID

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

Cites Work

• A rank-corrected procedure for matrix completion with fixed basis coefficients
• Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
• DC formulations and algorithms for sparse optimization problems
• Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
• Computing B-Stationary Points of Nonsmooth DC Programs
• DC Programming and DCA for General DC Programs
• Two-Point Step Size Gradient Methods
• Variational Analysis
• Composite Difference-Max Programs for Modern Statistical Estimation Problems
• Sparse Reconstruction by Separable Approximation
• Optimal Joint Base Station Assignment and Beamforming for Heterogeneous Networks
• A New Decomposition Method for Multiuser DC-Programming and Its Applications
• Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming
• Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
• Convex Analysis
• Penalty and Augmented Lagrangian Methods for Constrained DC Programming

This page was built for publication: Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization