Interior-point algorithms for global optimization (Q804475)

Interior-point algorithms are considered for nonconvex quadratic programming problems of the form \[ \text{ minimize } x^ TQx+c^ Tx,\text{ subject to } Ax=b,\quad x\geq 0, \] where \(Q\in R^{n\times n}\), \(c\in R^ n\), \(A\in R^{m\times n}\) and \(b\in R^ m\). The linear complementarity problem and integer programming are also discussed in a similar context. Complexity is discussed.