Abstract
article Remark on "Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]" Share on Authors: D. F. Shanno Department of Management Information Systems, College of Business and Public Administration, The University of Arizona, Tucson, AZ Department of Management Information Systems, College of Business and Public Administration, The University of Arizona, Tucson, AZView Profile , K. H. Phua Department of Computer Science, Nanyang University, Upper Jurong Road, Singapore 22, Republic of Singapore Department of Computer Science, Nanyang University, Upper Jurong Road, Singapore 22, Republic of SingaporeView Profile Authors Info & Claims ACM Transactions on Mathematical SoftwareVolume 6Issue 4Dec. 1980 pp 618–622https://doi.org/10.1145/355921.355933Published:01 December 1980 178citation975DownloadsMetricsTotal Citations178Total Downloads975Last 12 Months9Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Keywords
Affiliated Institutions
Related Publications
Algorithm 630
article Free AccessArtifacts AvailableArtifacts Evaluated & Reusable Share on Algorithm 630: BBVSCG–a variable-storage algorithm for function minimization Authors: A. Buckley De...
An Algorithm for Finding Best Matches in Logarithmic Expected Time
article Free Access Share on An Algorithm for Finding Best Matches in Logarithmic Expected Time Authors: Jerome H. Friedman Stanford Linear Accelerator Center, Stanford Universi...
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
article Free AccessLSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares Authors: Christopher C. Paige School of Computer Science, McGill University, Montreal,...
Properties of Conflict-Free and Persistent Petri Nets
article Free Access Share on Properties of Conflict-Free and Persistent Petri Nets Authors: L. H. Landweber Computer Sciences Department, University of Wisconsin-Madison, Madiso...
The perceptron algorithm vs. Winnow
Article The perceptron algorithm vs. Winnow: linear vs. logarithmic mistake bounds when few input variables are relevant Share on Authors: Jyrki Kivinen Department of Computer S...
Publication Info
- Year
- 1980
- Type
- article
- Volume
- 6
- Issue
- 4
- Pages
- 618-622
- Citations
- 246
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1145/355921.355933