1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.OC2023★ 1 cited
Lagrangian-based methods in convex optimization: prediction-correction frameworks with non-ergodic convergence rates
Tao Zhang, Yong Xia, Shiru Li
Lagrangian-based methods are classical methods for solving convex optimization problems with equality constraints. We present novel prediction-correction frameworks for such method…
math.OC2022
On globally solving nonconvex trust region subproblem via projected gradient method
Mengmeng Song, Yong Xia, Jinyang Zheng
The trust region subproblem (TRS) is to minimize a possibly nonconvex quadratic function over a Euclidean ball. There are typically two cases for (TRS), the so-called ``easy case''…