In this paper we describe a random generator for large and sparse quadratic programming problems that frequently arise in different areas of applied science. This generator is an useful tool in testing algorithms on QP problems with different features, since it allows us to vary many parameters which characterize the problems. The procedure used to generate a QP problem as well as some details for its implementation are explained. Finally, we report an analysis of the numerical results, obtained by the routine E04NFK of the NAG library on the test problems produced by the generator. C. Durazzi V. Ruggiero Dipartimento di Matematica, Universita di Ferrara, Via Machiavelli 35, Ferrara, Italy. E-mail: {dzc,rgv}@dns.unife.it. L. Zanni Dipartimento di Matematica, Universita di Modena e Reggio Emilia, Via Campi 213/b, 41100 Modena, Italy. E-mail: zanniluca@unimo.it. a random generator for quadratic programming test problems
[1]
B. R. Hunt,et al.
Digital Image Restoration
,
1977
.
[2]
Jong-Shi Pang,et al.
Iterative methods for variational and complementarity problems
,
1982,
Math. Program..
[3]
P. Gill,et al.
Maintaining LU factors of a general sparse matrix
,
1987
.
[4]
P. Marcotte,et al.
An extended descent framework for variational inequalities
,
1994
.
[5]
Nicholas I. M. Gould,et al.
CUTE: constrained and unconstrained testing environment
,
1995,
TOMS.
[6]
M. Patriksson.
Nonlinear Programming and Variational Inequality Problems: A Unified Approach
,
1998
.