13 citations · 19 across the 3 of their papers we have counts for
3 papers
math.OC2020★ 3 cited
An Adaptive Parameter-free and Projection-free Restarting Level Set Method for Constrained Convex Optimization Under the Error Bound Condition
Qihang Lin, Negar Soheili, Runchao Ma +1
Recent efforts to accelerate first-order methods have focused on convex optimization problems that satisfy a geometric property known as error-bound condition, which covers a broad…
math.OC2019★ 13 cited
Inexact Proximal-Point Penalty Methods for Constrained Non-Convex Optimization
Qihang Lin, Runchao Ma, Yangyang Xu
In this paper, an inexact proximal-point penalty method is studied for constrained optimization problems, where the objective function is non-convex, and the constraint functions c…
math.OC2019★ 3 cited
Quadratically Regularized Subgradient Methods for Weakly Convex Optimization with Weakly Convex Constraints
Runchao Ma, Qihang Lin, Tianbao Yang
Optimization models with non-convex constraints arise in many tasks in machine learning, e.g., learning with fairness constraints or Neyman-Pearson classification with non-convex l…