553 citations
- Beihang UniversityCN66 papers
- Microsoft Research Asia (China)CN12 papers
- Chinese Academy of SciencesCN9 papers
- Tsinghua UniversityCN6 papers
- National Cheng Kung UniversityTW4 papers
- University of Chinese Academy of SciencesCN4 papers
- Institute of SoftwareCN3 papers
- Zhejiang UniversityCN3 papers
- CAS Key Laboratory of Quantum Information, USTCCN2 papers
- Nankai UniversityCN2 papers
- State Key Laboratory of Computer Science2 papers
- State Key Laboratory of Low-Dimensional Quantum Physics2 papers
4 papers · 2 filters
An Improved Analysis of Semidefinite Approximation Bound for Nonconvex Nonhomogeneous Quadratic Optimization with Ellipsoid Constraints
Yong Xia, Shu Wang, Zi Xu
We consider the problem of approximating nonconvex quadratic optimization with ellipsoid constraints (ECQP). We show some SDP-based approximation bounds for special cases of (ECQP)…
On the p-regularized trust region subproblem
Yong Hsia, Ruey-Lin Sheu, Ya-xiang Yuan
The -regularized subproblem (p-RS) is a regularisation technique in computing a Newton-like step for unconstrained optimization, which globally minimizes a local quadratic appro…
Strong Duality for Generalized Trust Region Subproblem: S-Lemma with Interval Bounds
Shu Wang, Yong Xia
With the help of the newly developed S-lemma with interval bounds, we show that strong duality holds for the interval bounded generalized trust region subproblem under some mild as…
S-Lemma with Equality and Its Applications
Yong Xia, Shu Wang, Ruey-Lin Sheu
Let and be two quadratic functions having symmetric matrices and . The S-lemma with equality asks when the unsolvability of the sys…