Preprocessing for quadratic programming

Mathematical Programming

Volumn 100, Issue 1, 2004, Pages 95-132

  Gould, Nick ^a   Toint, Philippe L ^b  

^a RUTHERFORD APPLETON LABORATORY   (United Kingdom)

^b UNIVERSITY OF NAMUR   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBLEM SOLVING; VECTORS;

PREPROCESSING TECHNIQUES; PRIORI INFORMATION; QUADRATIC PROGRAMS; TRANSFORM PROBLEMS;

QUADRATIC PROGRAMMING;

EID: 19844366207     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-003-0487-2     Document Type: Review

References (16)

1. Andersen, E.D., Andersen, K.D.: Preserving in linear programming. Math. Program. 71(2), 221-245 (1995)
2. Bongartz, I., Conn, A.R., Gould, N.I.M., Toint, Ph.L.: CUTE: Constrained and Unconstrained Testing Environment. Transactions of the ACM on Math. Softw. 21(1), 123-160 (1995)
3. Bradley, G.H., Brown, G.G., Graves, G.W.: Structural redundancy in large-scale optimization models. In: M.H. Karwan et al., (ed.), Redundancy in Mathematical Programming, Springer Verlag, Heidelberg, 1983, pp. 145-169
4. Brearley, A.L., Mitra, G., Williams, H.P.: Analysis of mathematical programming problems prior to applying the simplex algorithm. Math. Program. 8(1), 54-83 (1975)
5. Conn, A.R., Gould, N.I.M., Orban, D., Toint, Ph.L.: A primal-dual trust-region algorithm for minimizing a non-convex function subject to bound and linear equality constraints. Math. Program. 87(2), 215-249 (2000)
6. Duff, I.S., Erisman, A.M., Reid, J.K.: Direct Methods for Sparse Matrices. Oxford University Press, Oxford, England, 1986
7. Ferris, M.C., Munson, T.S.: Preprocessing complementarity problems. In: M.C. Ferris, O.Mangasarian and J.S. Pang, (eds.), Complementarity: Applications, Algorithms and Extensions, Kluwer Academic Publishers, Dordrecht, 2001 pp. 143-164
8. Fourer, R., Gay, D.M.: Experience with a primal presolve algorithm. In: W.W. Hager, D.W. Hearn and P.M. Pardalos, (eds.), Large Scale Optimization: State of the Art, Kluwer Academic Publishers, Dordrecht, 1994, pp. 135-154
9. Gondzio, J.: Presolve analysis of linear programs prior to applying an interior point method. INFORMS J. Comput. 9(1), 73-91 (1997)
10. Gould, N.I.M., Toint, Ph.L.: Numerical methods for large-scale non-convex quadratic programming. In: A.H. Siddiqi and M.Kočvara, (eds.), Trends in Industrial and Applied Mathematics, Kluwer Academic Publishers, Dordrecht, 2002 pp. 149-179
11. Gould, N.I.M., Orban, D., Toint, Ph.L.: CUTEr, a contrained and unconstrained testing environment, revisited. Transactions of the ACM on Mathematical Software, to appear (2003a)
12. Gould, N.I.M., Orban, D., Toint, Ph.L.: GALAHAD - a library of thread-safe Fortran90 packages for large-scale nonlinear optimization. Transactions of the ACM on Mathematical Software, to appear (2003b)
13. Gould, N.I.M., Orban, D., Sartenaer, A., Toint, Ph.L.: Componentwise fast convergence in solving nonlinear equations. Math. Program., Ser. B 92(3), 481-508 (2002)
14. Ioslovich, I.: Robust reduction of a class of large-scale linear programs. SIAM J. Optim. 12(1), 262-282 (2001)
15. Tomlin, J. A., Welch, J.S.: Formal optimization of some reduced linear programming problems. Math. Program. 27(2), 232-240 (1983a)
16. Tomlin, J.A., Welch, J.S.: A pathological case in the reduction of linear programs. Oper. Res. Lett. 2, 53-57 (1983b)