A Presentation of Several Simplex Optimization Techniques |
Common terms and phrases
algorithm approximate AVERAGES Chebyquad coefficient components considered contraction convergence cost deal DELTA dimensions Discussion effect efficiency elements Equation estimation EVAL evaluate f(x expansion Figure FORMAT four FUNC function evaluations given GO TO 21 GO TO 64 go to step gradient improve INC1 increased indicate initial simplex involve iteration LEAST less limit magnitude Mead's method measure method presented methods G minimum MODBAD=1 modification Nelder and Mead objective function optimization parameter performance PMIN presented presented in Chapter PRINT problem Proceed PRODUCES PSTORE quadratic Refer reflection relative replace represent require return to step Rosenbrock sample search method selection set MODBAD equal SIMPLEX METHOD Singular Squared STATEMENTS successful Table technique TEST FUNCTION thesis tion values variables vector vertex vertices weighting Wood zero