DeepRead
Cover of Nonlinear Programming

Nonlinear Programming

Dimitri P. Bertsekas, Dimitri Bertsekas · 1995

Mathematics and physics › Numerical and matrix computation

#7,258 most recommended

About the book

The book covers nonlinear programming, the problem of minimizing a nonlinear objective function subject to equality and inequality constraints. It treats both unconstrained and constrained problems and gives the iterative algorithms used to solve them, with attention to their convergence behavior. The book holds that optimality conditions, Lagrange multiplier theory, and duality should be developed alongside the algorithms, since the multipliers drive both the theory and the methods. It presents gradient-type, Newton-type, penalty, and augmented Lagrangian methods within one framework, analyzed by convergence and rate of convergence. It also addresses large-scale problems, where decomposition and incremental methods make the computation tractable.

Written by Claude from what it knows of this book.

What Hacker News says 20% recommend · 0% critical

00.5120102015202020242010 peak · 1
This bookAverage book in Numerical and matrix computation

In the commenters’ own words

What Open Library readers say 5.00 from 2 ratings

  1. 52
  2. 40
  3. 30
  4. 20
  5. 10
  • 18 want to read
  • 0 reading
  • 2 have read

Only 2 ratings: treat the average as a hint.

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
1995
ISBN
9781886529144
Editions known
6 at Open Library
Open Library
OL2021800W

Mathematical optimizationNichtlineare OptimierungNiet-lineaire programmeringNonlinear programmingOptimaliserenOptimisation mathématiqueProgrammation non linéaireTechnology

Explore in the mosaic

Read next: its neighbours on the mosaic