ACM Home Page
Please provide us with feedback. Feedback
Remark on “Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]”
Full text PdfPdf (301 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 6 ,  Issue 4  (December 1980) table of contents
Pages: 618 - 622  
Year of Publication: 1980
ISSN:0098-3500
Authors
D. F. Shanno  Department of Management Information Systems, College of Business and Public Administration, The University of Arizona, Tucson, AZ
K. H. Phua  Department of Computer Science, Nanyang University, Upper Jurong Road, Singapore 22, Republic of Singapore
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 71,   Citation Count: 11
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/355921.355933
What is a DOI?

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
BRODLIE, K.W. An assessment of two approaches to variable metric methods. Math. Program. 12 (1977), 334-355.
 
2
FLETCHER, R., AND POWELL, M.J.D. A rapidly convergent descent method for minimization. Comput. J. 6 (1963), 163-168.
 
3
HIMMELBLAU, D.M. Applied Nonhnear Programming. McGraw-Hill, New York, 1972.
 
4
MORE, J J., GARBOW, B.S., AND HILLSTROM, K.E. Testing unconstrained m~mmizatlon software TM-324, Appl. Math. Dlv, Argonne National Lab., Argonne, Ill., 1978.
 
5
ORES, S.S. Self-scaling variable metric algorithm. Part II. Manage. Sci 20 (1974), 863-874.
 
6
POWELL, M.J.D. Some global convergence properties of a variable metric algorithm for minimization without exact line searches, in Nonhnear Programming, R.W. Cottle and C.E. Lemke, Eds., American Mathematical Soc, Providence, R.I., 1976
 
7
SHAI~NO, D.F. Conjugate gradient methods with inexact searches. Math. Oper. Res. 3 (1978), 244-256.
 
8
SHANNO, D.F. On the convergence of a new conjugate gradient method. SIAM. J Numer Anal 15 (1978), 1247-1257.
 
9
SHANNO, D.F. Quadratm termination of coniugate gradient methods. In Extrenal Methods and Systems Analys~s, A.V. Fiacco and K.O. Kortanek, Eds, Sprmger-Verlag, New York, 1980, pp. 4 33-441.
 
10
SHANSO, D.F., ASD PHUA, K.H. Matrix conditiomng and nonlinear optimization. Math. Program 14 (1978), 149-160.
11
 
12
TOlNT, Pa.L. Some numerical results using a sparse matrix updating formula in unconstrained optimization. Math. Comput. 32 (1978), 839-852.

CITED BY  11

Collaborative Colleagues:
D. F. Shanno: colleagues
K. H. Phua: colleagues