Showing math.OCShow all
3 papers · 1 filter
math.OC2025
A Near-optimal Method for Linearly Constrained Composite Non-convex Non-smooth Problems
Wei Liu, Qihang Lin, Yangyang Xu
We study first-order methods (FOMs) for solving \emph{composite nonconvex nonsmooth} optimization with linear constraints. Recently, the lower complexity bounds of FOMs on finding…
math.OC2025
Lower Complexity Bounds of First-order Methods for Affinely Constrained Composite Non-convex Problems
Wei Liu, Qihang Lin, Yangyang Xu
Many recent studies on first-order methods (FOMs) focus on \emph{composite non-convex non-smooth} optimization with linear and/or nonlinear function constraints. Upper (or worst-ca…
math.OC2025
A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization
Wei Liu, Yangyang Xu
Many real-world problems, such as those with fairness constraints, involve complex expectation constraints and large datasets, necessitating the design of efficient stochastic meth…