A Unified Approach To One-parametric General Quadratic Programming
Published 1985 · Mathematics, Computer Science
A method is proposed for finding local minima to the parametric general quadratic programming problem where all the coefficients are linear or polynomial functions of a scalar parameter. The local minimum vector and the local minimum value are determined explicitly as rational functions of the parameter. A numerical example is given.