52 pages matching determine in this book
Results 1-3 of 52
What people are saying - Write a review
We haven't found any reviews in the usual places.
PART TWO Unconstrained Nonlinear Programming Methods
UNCONSTRAINED MINIMIZATION PROCEDURES
9 other sections not shown
active constraints algorithm analytical Appendix approximation CALL SUMR Chap coefficients conjugate directions convergence convex convex function criteria Davidon Davidon-Fletcher-Powell defined described in Sec determine direction of search eigenvalues elements equality constraints equations exploratory search extremum feasible point feasible region Fiacco Fletcher flexible polyhedron flexible tolerance function evaluations function f(x hessian matrix hypersphere illustrates independent variables initial polyhedron iterations Lagrange multipliers linear constraints linear programming linear programming problem minimization minimum Nelder and Mead Newton's method nonlinear inequality constraints nonlinear programming problem number of functional objective function obtained off(x optimum parameters Partan partial derivatives penalty function positive definite Powell Prob procedure projection quadratic function reduced gradient Rosenbrock Rosenbrock's function saddle point satisfied search direction simplex solve stage starting point steepest descent step length straints SUBROUTINE Table technique termination test problems tion trajectory unconstrained unidimensional search value of f(x vertex vertices zero