Article contents
An interior point algorithm for convex quadratic programming withstrict equilibrium constraints
Published online by Cambridge University Press: 15 July 2005
Abstract
We describe an interior point algorithm for convex quadratic problem with a
strict complementarity constraints. We show that under some assumptions the
approach requires a total of $O(\sqrt{n}L)$ number of iterations, where L
is the input size of the problem. The algorithm generates a sequence of problems, each of which is
approximately solved by Newton's method.
Keywords
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2005
References
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20161010050515589-0683:S0399055905000028:S0399055905000028_eqnU2.gif?pub-status=live)
- 1
- Cited by