A View of Unconstrained Minimization Algorithms that Do Not Require Derivatives

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: M. J. D. Powell Computer Science and Systems Division, Building 8.9, AERE Harwell, Didcot, 0X11 ORA, England
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 1 Issue 2, June 1975
Pages 97-107
ACM New York, NY, USA
table of contents doi>10.1145/355637.355638
A View of Unconstrained Minimization Algorithms that Do Not Require Derivatives Published by ACM 1975 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 28
· Downloads (cumulative): 702
· Citation Count: 0


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder