Methods of optimization

Front Cover
Wiley, Jan 1, 1975 - Mathematics - 200 pages
0 Reviews
Nonlinear programming. Kuhn-tucker necessary conditions. Saddle-point property of the lagrangian functions. The constraint qualification. Search methods for unconstrained optimization. Grild search. Hooke and jeeves' method. Spendley, hext and himsworth's method. Nelder and mead's method. Gradient methods for unconstrained optimization. Method of steepest descent. The newton-raphson method. The davidon-fletcher-powell method. Constrained optimization. Hemstitching. The gradient projection method. Penalty functions. Dynamic programming The allocation problem. Oriented networks. The farmer's problem.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.


Nonlinear Programming
Search Methods for Unconstrained Optimization

5 other sections not shown

Other editions - View all

Common terms and phrases

Bibliographic information