Optimality analysis on ℓ 0/1 -sparsity regularized nonsmooth optimization

DOI10.1080/02331934.2024.2402436MaRDI QIDQ6894293zbMATH OpenFDO

Authors Dongrui Wang, Penghe Zhang, Naihua Xiu

Publication date 25 November 2025

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2024.2402436

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites work

• A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
• Exact penalty functions in nonlinear programming
• Extension of Hoffman’s Error Bound to Polynomial Systems
• First-order methods in optimization
• scientific article; zbMATH DE number 45255 (Why is no real title available?)
• Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs
• Non-parametric analysis of a generalized regression model. The maximum rank correlation estimator
• Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization
• Robust regression: Asymptotics, conjectures and Monte Carlo
• Statistical foundations of data science
• Support-vector networks
• Variational Analysis

This page was built for publication: Optimality analysis on ℓ _0/1 -sparsity regularized nonsmooth optimization

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