Abstract
We propose a convex quadratic programming (CQP) relaxation for multi-ball constrained quadratic optimization (MB). (CQP) is shown to be equivalent to ......
小提示:本篇文献需要登录阅读全文,点击跳转登录