Methods of OptimizationNonlinear 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. |
Contents
Introduction | 1 |
Search Methods for Unconstrained Optimization | 74 |
35 | 115 |
Copyright | |
4 other sections not shown
Other editions - View all
Common terms and phrases
b₁ b₂ complementary DFP concave function constraint boundary constraint qualification convex function convex set current point d₂ defined DFP method direction of search dynamic programming equality constraints equation evaluations Example f₁ function f(x function value g₁ given global maximum Golden Section search gradient methods H₁ H₂ Hence Hessian matrix inequality constraints initial point Kuhn-Tucker necessary conditions Lagrange multipliers Lagrangian function linear programming linear programming problem linear searches local maximum matrix maximize Maximize z maximum of f(x maximum value minimal path minimizes f(x minimum mutually conjugate directions node non-negativity restrictions nonlinear programming nonlinear programming problem objective function obtain optimal point optimal solution optimization problem optimization technique positive definite Powell's method problem 2.1 proof quadratic function quadratic programming quadratic programming problem saddle-point search direction Section solve step lengths surplus variables Theorem unconstrained optimization vector x'Dx x₁ x₁² x₂