64 citations · 279 across the 30 of their papers we have counts for
5 papers · 1 filter
Heaviside Set Constrained Optimization: Optimality and Newton Method
Shenglong Zhou, Lili Pan, Naihua Xiu
Data in the real world frequently involve binary status: truth or falsehood, positiveness or negativeness, similarity or dissimilarity, spam or non-spam, and to name a few, with ap…
Sparse SVM for Sufficient Data Reduction
Shenglong Zhou
Kernel-based methods for support vector machines (SVM) have shown highly advantageous performance in various applications. However, they may incur prohibitive computational costs f…
Newton Hard Thresholding Pursuit for Sparse LCP via A New Merit Function
Shenglong Zhou, Meijuan Shang, Lili Pan +1
Solutions to the linear complementarity problem (LCP) are naturally sparse in many applications such as bimatrix games and portfolio section problems. Despite that it gives rise to…
Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization
Alain Zemkoho, Shenglong Zhou
The Karush-Kuhn-Tucker and value function (lower-level value function, to be precise) reformulations are the most common single-level transformations of the bilevel optimization pr…
Newton method for -regularized optimization
Shenglong Zhou, Lili Pan, Naihua Xiu
As a tractable approach, regularization is frequently adopted in sparse optimization. This gives rise to the regularized optimization, aiming at minimizing the norm or its…