Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure
This paper extends a primal-dual interior point procedure for linear programs to the case of convex separable quadratic objectives. Included are efficient procedures for: attaining primal and dual feasibility, variable upper bounding, and free variables. A sequential procedure that invokes the quadratic solver is proposed and implemented for solving linearly constrained convex separable nonlinear programs. Computational results are provided for several large test cases from stochastic programming. The proposed methods compare favorably with MINOS, especially for the larger examples. The nonlinear programs range in size up to 8,700 constraints and 22,000 variables.
INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.