An algorithm for solving convex programs subject to box constraints
There is proposed a method for solving convex programs with linear constraints and bounds on the variables. The algorithm finishes in a finite number of iterations.
scientific article; zbMATH DE number 1689555