| A test problem generator for large-scale unconstrained optimization |
| Full text |
Pdf
(293 KB)
|
| Source
|
ACM Transactions on Mathematical Software (TOMS)
archive
Volume 11 , Issue 2 (June 1985)
table of contents
Pages: 97 - 102
Year of Publication: 1985
ISSN:0098-3500
|
|
Authors
|
|
R. S. Dembo
|
School of Organization and Management, Yale University, Box 1A, New Haven, CT
|
|
T. Steihaug
|
Statoil, Forus, P.O. Box 300, 4001 Stawanger, Norway
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 25, Citation Count: 0
|
|
|
ABSTRACT
A test problem generator for large-scale unconstrained optimization is described. It permits the generation of a poorly or well-conditioned problems of arbitrary size, derived from nonlinear network flow models. An eigenvalue analysis provides bounds on the condition number of the Hessian of the objective function and an example of an efficient preconditioner, using these bounds, is outlined.
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
|
COLVILLE, A.R. A comparative study on nonlinear programming codes. In Proceedings of the Princeton Symposium on Mathematical Programming, H. W. Kuhn, Ed. Princeton University Press, Princeton, N.J., 1970, pp. 487-501.
|
| |
2
|
DEMBO, R.S. A set of geometric programming test problems and their solutions. Math. Program. I0 (1976), 192-214.
|
| |
3
|
DEMnO, R. S., AND STEIHAUG, T. Truncated-Newton algorithms for large-scale unconstrained optimization. Math. Program. 26 (1983), 190-212.
|
| |
4
|
FxAcco, A. V., AND MCCORMICK, G. P. Nonlinear Programming: Sequential Unconstrained Minimization Techniques. Wiley, New York, 1968.
|
| |
5
|
HESTENE$, M.R. Conjugate Direction Methods in Optimization. Springer-Verlag, New York, 1980.
|
| |
6
|
SCHI~rKOWSKI, K. Nonlinear Programming Codes--Information Tests and Performance. Lecture Notes in Economics and Mathematical Systems, no. 183. Springer-Verlag, New York, 1980.
|
| |
7
|
TOINT, P.L. Some numerical results using a sparse matrix updating in unconstrained optimization. Math. Comput. 32 (1978), 839-851.
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|