1 citations · 2 across the 7 of their papers we have counts for
5 papers · 2 filters
A family of Barzilai-Borwein steplengths from the viewpoint of scaled total least squares
Shiru Li, Tao Zhang, Yong Xia
The Barzilai-Borwein (BB) steplengths play great roles in practical gradient methods for solving unconstrained optimization problems. Motivated by the observation that the two well…
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''…
Comment on "First-order methods almost always avoid strict saddle points"
Jinyang Zheng, Yong Xia
The analysis on the global stability of Riemannian gradient descent method in manifold optimization (i.e., it avoids strict saddle points for almost all initializations) due to Lee…
Alternating direction method of multipliers for convex programming: a lift-and-permute scheme
Shiru Li, Yong Xia, Tao Zhang
A lift-and-permute scheme of alternating direction method of multipliers (ADMM) is proposed for linearly constrained convex programming. It contains not only the newly developed ba…
Simultaneous perturbation stochastic approximation: towards one-measurement per iteration
Shiru Li, Yong Xia, Zi Xu
When measuring the value of a function to be minimized is not only expensive but also with noise, the popular simultaneous perturbation stochastic approximation (SPSA) algorithm re…