The implementation of the algorithms with Python is currently under development, and available only for the following chapters. The environment used is Jupyter. In addition to the code of the algorithms, the Jupyter notebooks include also the code to reproduce many tables and figures published in the book.
For each chapter, complete frozen copy of the notebook in HTML is made available.
- 7. Newton's method
- 8. Quasi-Newton methods
- 9. Quadratic problems
- 10. Newton's local method
- 11. Descent methods and line search
- 12. Trust region
- 13. Quasi-Newton methods
- 14. Least squares problem
- 15. Direct search methods
- 16. The simplex method
This material contains sample programming source code ("Sample Code"). Michel Bierlaire ("the author") grants you a nonexclusive license to run, display, reproduce, distribute and prepare derivative works of this Sample Code. The Sample Code has not been thoroughly tested under all conditions. The author, therefore, does not guarantee or imply its reliability, serviceability, or function. The author provides no program services for the Sample Code.
All Sample Code contained herein is provided to you "AS IS" without any warranties of any kind. THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGMENT ARE EXPRESSLY DISCLAIMED. SOME JURISDICTIONS DO NOT ALLOW THE EXCLUSION OF IMPLIED WARRANTIES, SO THE ABOVE EXCLUSIONS MAY NOT APPLY TO YOU. IN NO EVENT WILL THE AUTHOR BE LIABLE TO ANY PARTY FOR ANY DIRECT, INDIRECT, SPECIAL OR OTHER CONSEQUENTIAL DAMAGES FOR ANY USE OF THE SAMPLE CODE INCLUDING, WITHOUT LIMITATION, ANY LOST PROFITS, BUSINESS INTERRUPTION, LOSS OF PROGRAMS OR OTHER DATA ON YOUR INFORMATION HANDLING SYSTEM OR OTHERWISE, EVEN IF WE ARE EXPRESSLY ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.