Certain types of quadratic programs with linear constraints have the property that an extreme point of the convex set of feasible solutions is an optimal solution. This paper presents a procedure for ...

This paper considers the convex minimization problem with linear constraints and a separable objective function which is the sum of many individual functions without coupled variables. An algorithm is ...

The LICOMP technique solves a quadratic problem as a linear complementarity problem. It can be used only if G is positive (negative) semi-definite for minimization (maximization) and if the parameters ...