Numerical Methods for Unconstrained Optimization and Nonlinear Equations |
Contents
INTRODUCTION | 1 |
NONLINEAR PROBLEMS | 15 |
ALGEBRA BACKGROUND | 40 |
Copyright | |
9 other sections not shown
Other editions - View all
Numerical Methods for Unconstrained Optimization and Nonlinear Equations J. E. Dennis,Robert B. Schnabel No preview available - 1987 |
Common terms and phrases
Broyden's method calculate CALL Chapter cheapF Cholesky continuously differentiable convergence convex set D₂ decomposition derivatives descent direction diagonal digits discussed driver evaluations example Exercise f(x+ f(xx factorization factsec finite finite-difference Frobenius norm function Gauss-Newton method global gradient Guideline Hessian Input Parameters Input-Output Parameters iteration Jacobian Lemma line search linear Lipschitz continuous macheps matrix norm matrix storage maxstep minimization problem modules Newton step Newton's method nonlinear equations nonlinear least nonlinear problems nonsingular norm orthogonal matrix Output Parameters positive definite secant proof q-quadratically QR decomposition quadratic model quasi-Newton quasi-Newton method retcode RETURN from Algorithm rithm S₂ scaling secant approximations secant method Section sequence solution solving stepsize steptol Storage Considerations system of algorithms termcode Theorem trust region unconstrained minimization V²f(x variable vector Vf(x Vƒ(x x₁ zero