Numerical Optimization

Authors:

ISBN: 978-0-387-30303-1 (Print) 978-0-387-40065-5 (Online)

Table of contents (19 chapters)

  1. Front Matter

    Pages i-xxii

  2. No Access

    Book Chapter

    Pages 1-9

    Introduction

  3. No Access

    Book Chapter

    Pages 10-29

    Fundamentals of Unconstrained Optimization

  4. No Access

    Book Chapter

    Pages 30-65

    Line Search Methods

  5. No Access

    Book Chapter

    Pages 66-100

    Trust-Region Methods

  6. No Access

    Book Chapter

    Pages 101-134

    Conjugate Gradient Methods

  7. No Access

    Book Chapter

    Pages 135-163

    Quasi-Newton Methods

  8. No Access

    Book Chapter

    Pages 164-192

    Large-Scale Unconstrained Optimization

  9. No Access

    Book Chapter

    Pages 193-219

    Calculating Derivatives

  10. No Access

    Book Chapter

    Pages 220-244

    Derivative-Free Optimization

  11. No Access

    Book Chapter

    Pages 245-269

    Least-Squares Problems

  12. No Access

    Book Chapter

    Pages 270-302

    Nonlinear Equations

  13. No Access

    Book Chapter

    Pages 304-354

    Theory of Constrained Optimization

  14. No Access

    Book Chapter

    Pages 355-391

    Linear Programming: The Simplex Method

  15. No Access

    Book Chapter

    Pages 392-420

    Linear Programming: Interior-Point Methods

  16. No Access

    Book Chapter

    Pages 421-447

    Fundamentals of Algorithms for Nonlinear Constrained Optimization

  17. No Access

    Book Chapter

    Pages 448-492

    Quadratic Programming

  18. No Access

    Book Chapter

    Pages 497-528

    Penalty and Augmented Lagrangian Methods

  19. No Access

    Book Chapter

    Pages 529-562

    Sequential Quadratic Programming

  20. No Access

    Book Chapter

    Pages 563-597

    Interior-Point Methods for Nonlinear Programming

  21. Back Matter

    Pages 598-664