×

zbMATH — the first resource for mathematics

An algorithm for indefinite quadratic programming based on a partial Cholesky factorization. (English) Zbl 0795.90048
Summary: A new algorithm is described for quadratic programming that is based on a partial Cholesky factorization that uses a diagonal pivoting strategy and allows computation of null of 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. We thus 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.

MSC:
90C20 Quadratic programming
90-08 Computational methods for problems pertaining to operations research and mathematical programming
90C31 Sensitivity, stability, parametric optimization
PDF BibTeX XML Cite
Full Text: DOI EuDML