On some interior-point algorithms for nonconvex quadratic optimization (Q1396211)

The paper is concerned with the quadratic optimization problem \(\min f(x)=x^T Q x\) subject to \(x \geq 0\), where \(Q\) is a symmetric possibly indefinite matrix. The authors give several examples showing that in the case where \(\inf_{x \geq 0} f(x)=-\infty\), the central-path following method and the affine-scaling method may converge to the origin, which is not even a local minimum.