Skip to Main content Skip to Navigation
Reports

Dealing with degenerated cases in quadratic programming

Abstract : A new algorithm is described for quadratic programming which is based on a Cholesky factorization that uses a diagonal pivoting strategy and that allows to compute null or negative curvature directions. The algorithm is numerically stable and has shown efficiency solving positive-definite and indefinite problems. It is specially interesting in indefinite cases because the initial point does not need to be a vertex of the feasible set. So we avoid introducing artificial constraints in the problem, which turns out to be very efficient in parametric programming. At the same time techniques for updating matrix factorizations are used.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00075433
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 6:12:10 PM
Last modification on : Thursday, February 11, 2021 - 2:50:07 PM
Long-term archiving on: : Tuesday, April 12, 2011 - 11:09:12 PM

Identifiers

  • HAL Id : inria-00075433, version 1

Collections

Citation

Eduardo Casas, Cecilia Pola. Dealing with degenerated cases in quadratic programming. [Research Report] RR-1126, INRIA. 1989. ⟨inria-00075433⟩

Share

Metrics

Record views

126

Files downloads

83