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.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of combinatorial optimization 2022-09, Vol.44 (2), p.1099-1103
Hauptverfasser:	Zhang, Tongli, Xia, Yong
Format:	Artikel
Sprache:	eng
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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