241 citations · 815 across the 44 of their papers we have counts for
Showing 2023 · math.OCShow all
3 papers · 2 filters
math.OC2023
Deterministic and Stochastic Accelerated Gradient Method for Convex Semi-Infinite Optimization
Yao Yao, Qihang Lin, Tianbao Yang
This paper explores numerical methods for solving a convex differentiable semi-infinite program. We introduce a primal-dual gradient method which performs three updates iteratively…
math.OC2023
First-order Methods for Affinely Constrained Composite Non-convex Non-smooth Problems: Lower Complexity Bound and Near-optimal Methods
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.OC2023★ 4 cited
Oracle Complexity of Single-Loop Switching Subgradient Methods for Non-Smooth Weakly Convex Functional Constrained Optimization
Yankun Huang, Qihang Lin
We consider a non-convex constrained optimization problem, where the objective function is weakly convex and the constraint function is either convex or weakly convex. To solve thi…