3 papers
math.OC2025
Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity
Jingfan Xia, Zhenwei Lin, Qi Deng
Randomized smoothing is a widely adopted technique for optimizing nonsmooth objective functions. However, its efficiency analysis typically relies on global Lipschitz continuity, a…
math.OC2024
Accelerating Low-Rank Factorization-Based Semidefinite Programming Algorithms on GPU
Qiushi Han, Zhenwei Lin, Hanwen Liu +4
In this paper, we address a long-standing challenge: how to achieve both efficiency and scalability in solving semidefinite programming problems. We propose breakthrough accelerati…
cs.LG2023
GBM-based Bregman Proximal Algorithms for Constrained Learning
Zhenwei Lin, Qi Deng
As the complexity of learning tasks surges, modern machine learning encounters a new constrained learning paradigm characterized by more intricate and data-driven function constrai…