On the Study of Quasipolyhedral Convex Functions
Different methods are available to solve a constrained optimization problem where the objective function is convex and the constraint set is specified by a linear system of a finite number of linear inequalities. In particular, the problem can be formulated as an optimization problem with a unique constraint involving...