Remark on “algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization”

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: José Luis Morales Instituto Tecnológico Autónomo de México, Mexico
Jorge Nocedal Northwestern University, Evanston, IL
Published in:
Cover Image
 
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 38 Issue 1, November 2011
Article No. 7
ACM New York, NY, USA
table of contents doi>10.1145/2049662.2049669
Remark on “algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization” Published by ACM 2011 Article
  • Research
  • Refereed
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 18
· Downloads (12 Months): 139
· Downloads (cumulative): 202
· Citation Count: 1


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