The Trust region affine interior point algorithm for convex and nonconvex quadratic programming - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1993

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

J. Frederic Bonnans
  • Function : Author
  • PersonId : 833418
  • IdHAL : bonnans
Mustapha Bouhtou
  • Function : Author

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.
Fichier principal
Vignette du fichier
RR-1947.pdf (950 Ko) Télécharger le fichier

Dates and versions

inria-00074726 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074726 , version 1

Cite

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⟩
94 View
69 Download

Share

Gmail Facebook X LinkedIn More