Least Squares Fit of Definite Quadratic Forms by Convex Programming

Published Online:https://doi.org/10.1287/mnsc.13.11.913

This paper considers the problem of fitting a quadratic regression law subject to the condition that the fitted surface be convex (concave). A computational algorithm is described for determining the constrained regression coefficients using an existing non-linear programming algorithm. Some of the properties of the estimators are described.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.