ABSTRACT
We explore a new model in mathematical programming in which a separable convex piecewise quadratic function is minimized subject to linear constraints. The discussion includes basic theories such as duality, optimality, boundedness of solutions, and parametric properties as well as some examples for applications. We also briefly review algorithms developed for this model.
