Numerical Optimization

Editors:

ISBN: 978-0-387-98793-4 (Print) 978-0-387-22742-9 (Online)

Table of contents (18 chapters)

  1. No Access

    Book Chapter

    Pages 1-9

    Introduction

  2. No Access

    Book Chapter

    Pages 10-32

    Fundamentals of Unconstrained Optimization

  3. No Access

    Book Chapter

    Pages 34-63

    Line Search Methods

  4. No Access

    Book Chapter

    Pages 64-99

    Trust-Region Methods

  5. No Access

    Book Chapter

    Pages 100-133

    Conjugate Gradient Methods

  6. No Access

    Book Chapter

    Pages 134-163

    Practical Newton Methods

  7. No Access

    Book Chapter

    Pages 164-191

    Calculating Derivatives

  8. No Access

    Book Chapter

    Pages 192-221

    Quasi-Newton Methods

  9. No Access

    Book Chapter

    Pages 222-249

    Large-Scale Quasi-Newton and Partially Separable Optimization

  10. No Access

    Book Chapter

    Pages 250-275

    Nonlinear Least-Squares Problems

  11. No Access

    Book Chapter

    Pages 276-312

    Nonlinear Equations

  12. No Access

    Book Chapter

    Pages 314-359

    Theory of Constrained Optimization

  13. No Access

    Book Chapter

    Pages 360-391

    Linear Programming: The Simplex Method

  14. No Access

    Book Chapter

    Pages 392-417

    Linear Programming: Interior-Point Methods

  15. No Access

    Book Chapter

    Pages 418-437

    Fundamentals of Algorithms for Nonlinear Constrained Optimization

  16. No Access

    Book Chapter

    Pages 438-486

    Quadratic Programming

  17. No Access

    Book Chapter

    Pages 488-525

    Penalty, Barrier, and Augmented Lagrangian Methods

  18. No Access

    Book Chapter

    Pages 526-573

    Sequential Quadratic Programming