Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Ciyou Zhu Northwestern Univ., Evanston, IL
Richard H. Byrd Univ. of Colorado at Boulder, Boulder
Peihuang Lu Northwestern Univ., Evanston, IL
Jorge Nocedal Northwestern Univ., Evanston, IL
Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization Published by ACM 1997 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 51
· Downloads (12 Months): 362
· Downloads (cumulative): 3,272
· Citation Count: 94

Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 23 Issue 4, Dec. 1997
Pages 550-560
ACM New York, NY, USA
table of contents doi>10.1145/279232.279236

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