Skip to Main content Skip to Navigation
Reports

The Trust region affine interior point algorithm for convex and nonconvex quadratic programming

Abstract : We study from a theoretical and numerical point of view an interior point algorithm for quadratic QP using a trust region idea, formulated by Ye and Tse. We show that, under some nondegeneracy hypothesis, the sequence of points converges to a stationary point at a linear rate. We obtain also an asymptotic linear convergence rate for the cost that depends only on the dimension of the problem. Then we show that, provided some modifications are added to the basic algorithm, the method has a good numerical behaviour.
Complete list of metadata

https://hal.inria.fr/inria-00074726
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 4:10:40 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: : Tuesday, April 12, 2011 - 6:39:18 PM

Identifiers

  • HAL Id : inria-00074726, version 1

Collections

Citation

J. Frederic Bonnans, Mustapha Bouhtou. The Trust region affine interior point algorithm for convex and nonconvex quadratic programming. [Research Report] RR-1947, INRIA. 1993. ⟨inria-00074726⟩

Share

Metrics

Record views

376

Files downloads

191