HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

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 :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 6:12:10 PM
Last modification on : Friday, February 4, 2022 - 3:18:51 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 11:09:12 PM


  • HAL Id : inria-00075433, version 1



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



Record views


Files downloads