Filter
Add to wishlist

A history of algorithms: from the pebble to the microchip eBook

$15.00

  • Delivery: Can be download immediately after purchasing. For new customer, we need process for verification from 30 mins to 24 hours.
  • Version: PDF/EPUB. If you need another version, please Contact us
  • Quality: Full page, full content, high quality images, searchable text and you can print it.
  • Compatible Devices: Can be read on any devices (Kindle, NOOK, Android/IOS devices, Windows, MAC,..).
  • e-Book Features: Purchase and read your book immediately, access your eTextbook anytime and anywhere, unlimited download and share with friends.
  • Note: If you do not receive the download link within 15 minutes of your purchase, please Contact us. Thank you!
  • 5% off all orders over $25 with code:: 5OFF2024
  • 10% off all orders over $50 with code: 10OFF2024
SKU: 9783540633693 Categories: ,

This up-to-date book is on algorithms for large-scale unconstrained and bound constrained optimization. Optimization techniques are shown from a conjugate gradient algorithm perspective.

Large part of the book is devoted to preconditioned conjugate gradient algorithms. In particular memoryless and limited memory quasi-Newton algorithms are presented and numerically compared to standard conjugate gradient algorithms.

The special attention is paid to the methods of shortest residuals developed by the author. Several effective optimization techniques based on these methods are presented.

Because of the emphasis on practical methods, as well as rigorous mathematical treatment of their convergence analysis, the book is aimed at a wide audience. It can be used by researches in optimization, graduate students in operations research, engineering, mathematics and computer science. Practitioners can benefit from numerous numerical comparisons of professional optimization codes discussed in the book.