62 citations · 186 across the 19 of their papers we have counts for
5 papers · 1 filter
A Random Active Set Method for Strictly Convex Quadratic Problem with Simple Bounds
Ran Gu, Bing Gao
Active set method aims to find the correct active set of the optimal solution and it is a powerful method for solving strictly convex quadratic problem with bound constraints. To g…
A Riemannian rank-adaptive method for low-rank matrix completion
Bin Gao, P. -A. Absil
The low-rank matrix completion problem can be solved by Riemannian optimization on a fixed-rank manifold. However, a drawback of the known approaches is that the rank parameter has…
Geometry of the symplectic Stiefel manifold endowed with the Euclidean metric
Bin Gao, Nguyen Thanh Son, P. -A. Absil +1
The symplectic Stiefel manifold, denoted by , is the set of linear symplectic maps between the standard symplectic spaces and $\mathbb{R}^{2n}…
Symplectic eigenvalue problem via trace minimization and Riemannian optimization
Nguyen Thanh Son, P. -A. Absil, Bin Gao +1
We address the problem of computing the smallest symplectic eigenvalues and the corresponding eigenvectors of symmetric positive-definite matrices in the sense of Williamson's theo…
New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition
Shuyu Dong, Bin Gao, Yu Guan +1
We propose new Riemannian preconditioned algorithms for low-rank tensor completion via the polyadic decomposition of a tensor. These algorithms exploit a non-Euclidean metric on th…