|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
BIRKHOFF, G. AND GULATI, S. Isotropic distributions of test matrices. Z. Angew. Math Phys. (ZAMP) 30 (1979), 148-158.
|
| |
2
|
CLARK, N.W. Applied Mathematics Division System/360 library subroutine RANF: ANL G552S. Argonne National Laboratory, Argonne, Ill., 1967.
|
| |
3
|
COLVILLE, A.R A comparative study of nonhnear programming codes. In Proc. Princeton Symposium on Mathemattcal Programming, H.W. Kuhn (Ed.), Princeton University Press, Princeton, N J., (1970), 487-501.
|
| |
4
|
CRANE, R.L., GARBOW, B.S., HILLSTROM, K.E., AND MINKOFF, U. LCLSQ: An implementation of an algorithm for hnearly constrained linear least-squares problems. Mathematics and Computers Rep. ANL-80-116, Argonne National Laboratory, Argonne, Ill., Nov., 1980.
|
| |
5
|
CROWDER, H.P., DEMBO, R.S., AND MULVEY, J.M. Reporting computational experiments in mathematmal programming. Math Program 15 (1978), 316-329.
|
| |
6
|
FLETCHER, R A general quadratic programming algorithm. J. Inst. Math. Appl. 7 (1971), 76-91.
|
 |
7
|
|
| |
8
|
|
 |
9
|
|
| |
10
|
LAWSON, C.L. AND HANSON, R.J. Solwng Least Squares Problems. Prentice-Hail, Engtewood Chffs, N.J., 1974 ACM Transactmns on Mathematical Software, VoL 10, No. 1, March 1984.
|
| |
11
|
LENAED, M.L. A computational study of active set strategies in nonlinear programming with linear constraints. Math. Program, 16 (1979), 81-87.
|
| |
12
|
LYNESS, J.N. A benchmark experiment for minimization algorithms. Math. Comput. 33 (1979), 249-264.
|
 |
13
|
|
| |
14
|
MINKOFF, M. Methods for evaluating nonlinear programming software. In Nonhnear Programmmg 4, O.L Mangasarian, R.R. Meyer and S.M. Robinson (Eds.), Academic Press, New York (1981), pp. 519-548.
|
 |
15
|
|
| |
16
|
SANDGREN, E. AND RAGSDELL, K.M. On some experiments whmh delimit the utihty of nonlinear programming methods for engineering design. In Mathematical Programming Study 16, A.G. Buckley and J.-L. Goffin (Eds.), Elsevier-North Holland, New York (1982), 118-136.
|
| |
17
|
SCHITTKOWSKI, K. AND STOER, J. A factorization method for constrained least squares problems with data changes: Part L Theory. Numer Math. 3l (1979), 431-463.
|
| |
18
|
STEWART, G.W. The efficmnt generation of random orthogonal matrices with an apphcation to condition estimators. SIAM J Numer Anal. 17 (1980), 403-409.
|
| |
19
|
STEWART, G W. Constrained definite Hessians tend to be well-conditioned. Math Program. 21 (1981), 235-238.
|
| |
20
|
VAN DAM, W.B., FRENK, J.B.G., AND TELGEN, J. Randomly generated polytopes for testing mathematical programming algorithms. Math Program. 26 (1983), 172-181.
|
|