62 citations · 104 across the 27 of their papers we have counts for
27 papers
The Continuous Relaxation of Sparse PCA is NP-hard
Linbin Li, Yong Xia
Maximizing a symmetric quadratic form under simultaneous L1 norm inequality and L2 norm equality constraints is a standard and widely used continuous relaxation for Sparse Principa…
Linear programming on the Stiefel manifold
Mengmeng Song, Yong Xia
Linear programming on the Stiefel manifold (LPS) is studied for the first time. It aims at minimizing a linear objective function over the set of all -tuples of orthonormal vect…
Comment on "Approximation algorithms for quadratic programming"
Tongli Zhang, Yong Xia
The radius of the outer Dikin ellipsoid of the intersection of ellipsoids due to Fu et al. (J. Comb. Optim., 2, 29-50, 1998) is corrected from to . The approx…
On local minimizers of generalized trust-region subproblem
Jiulin Wang, Mengmeng Song, Yong Xia
Generalized trust-region subproblem (GT) is a nonconvex quadratic optimization with a single quadratic constraint. It reduces to the classical trust-region subproblem (T) if the co…
Local Optimality Conditions for a Class of Hidden Convex Optimization
Mengmeng Song, Yong Xia, Hongying Liu
Hidden convex optimization is such a class of nonconvex optimization problems that can be globally solved in polynomial time via equivalent convex programming reformulations. In th…
Unifying Farkas lemma and S-lemma: new theory and applications in nonquadratic nonconvex optimization
Meijia Yang, Yong Xia, Shu Wang
We unify nonlinear Farkas lemma and S-lemma to a generalized alternative theorem for nonlinear nonconvex system. It provides fruitful applications in globally solving nonconvex non…