Abstract
The radius of the outer Dikin ellipsoid of the intersection of m ellipsoids due to Fu et al. (J. Comb. Optim., 2, 29-50, 1998) is corrected from m to \(\sqrt{m^2+m}\). The approximation bound for the general convex quadratic constrained nonconvex quadratic program is correspondingly corrected.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Availability of data and material
Enquiries about data availability should be directed to the authors.
References
Bienstock D (2016) A note on polynomial solvability of the CDT problem. SIAM Journal on Optimization 26:488–498
Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University press
Consolini L, Locatelli M (2017) On the complexity of quadratic programming with two quadratic constraints. Mathematical Programming 164:91–127
Fu M, Luo Z-Q, Ye Y (1998) Approximation algorithms for quadratic programming. Journal of Combinatorial Optimization 2:29–50
Henrion D, Tarbouriech S, Arzelier D (2001) LMI approximations for the radius of the intersection of ellipsoids: survey. Journal of Optimization Theory and Applications 108:1–28
Hsia Y, Wang S, Xu Z (2015) Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints. Operations Research Letters 43:378–383
Lovász L (1986) An algorithmic theory of numbers, graphs and convexity. SIAM
Nesterov YuE, Nemirovskii AS (1993) Interior point polynomial methods in convex programming: theory and algorithms. SIAM Publications, Philadelphia
Sakaue S, Nakatsukasa Y, Takeda A, Lwata S (2016) Solving generalized CDT problems via two-parameter eigenvalues. SIAM Journal on Optimization 36:1669–1694
Tseng P (2003) Further results on approximating nonconvex quadratic optimization by semidefinite programming relaxation. SIAM Journal on Optimization 14:268–283
Funding
Not applicable.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no known competing financial interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This research was supported by the Beijing Natural Science Foundation under Grant Z180005, and the National Natural Science Foundation of China under Grants 12171021 and 11822103.
Rights and permissions
About this article
Cite this article
Zhang, T., Xia, Y. Comment on “Approximation algorithms for quadratic programming”. J Comb Optim 44, 1099–1103 (2022). https://doi.org/10.1007/s10878-022-00881-y
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-022-00881-y