Cited By
View all- Schütze OHernández CTalbi ESun JNaranjani YXiong F(2019)Archivers for the representation of the set of approximate solutions for MOPsJournal of Heuristics10.1007/s10732-018-9383-z25:1(71-105)Online publication date: 1-Feb-2019
In this paper, a conic reformulation and approximation is proposed for solving a nonconvex quadratic programming problem subject to several convex quadratic constraints. The original problem is transformed into a linear conic programming problem, which ...
We consider the NP-hard problem of finding a minimum norm vector in $n$-dimensional real or complex Euclidean space, subject to $m$ concave homogeneous quadratic constraints. We show that a semidefinite programming (SDP) relaxation for this nonconvex ...
For some applications it is desired to approximate a set of m data points in \Bbb R n with a convex quadratic function. Furthermore, it is required that the convex quadratic approximation underestimate all m of the data points. It is shown here ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in