Answers are grounded in this paper and cite their sources.
An interior point method is developed for maximizing a concave quadratic function under convex quadratic constraints. The algorithm constructs a sequence of nested convex sets and finds their approximate centers using a partial Newton step. Given the first convex set and its approximate center, the total arithmetic operations required to converge to an approximate solution are of order O(√ m (m + n)n² ln ε ), where m is the number of constraints, n is the number of variables, and ε is determined by the desired tolerance of the optimal value and the size of the first convex set. A method to initialize the algorithm is also proposed so that the algorithm can start from an arbitrary (perhaps infeasible) point.
No takes yet. Share an insight, caveat, or question.
Mehrotra et al. (1991) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: