Comment on “Approximation algorithms for quadratic programming”

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 m 2 + m . The approximation bound for the general convex quadratic constrained nonconvex quadratic program is correspondingly corrected.

Saved in:
Bibliographic Details
Published inJournal of combinatorial optimization Vol. 44; no. 2; pp. 1099 - 1103
Main Authors Zhang, Tongli, Xia, Yong
Format Journal Article
LanguageEnglish
Published New York Springer US 2022
Springer Nature B.V
Subjects
Algorithms
Approximation
Combinatorics
Convex and Discrete Geometry
Ellipsoids
Mathematical analysis
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Quadratic programming
Theory of Computation
Dikin ellipsoid
Approximation bound
Quadratic constrained quadratic program
Online AccessGet full text

Cover

More Information
Summary: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 m 2 + m . The approximation bound for the general convex quadratic constrained nonconvex quadratic program is correspondingly corrected.
ISSN:1382-6905
1573-2886
DOI:10.1007/s10878-022-00881-y