| preface to the classics edition . preface 1 introduction 1.1 problems to be considered 1.2 characteristics of"real-world" problems 1.3 finite-precision arithmetic and measurement of error 1.4 exercises 2 nonlinear problems in one variable 2.1 what is not possible 2.2 newton's method for solving one equation in one unknown 2.3 convergence of sequences of real numbers 2.4 convergence of newton's method 2.5 globally convergent methods for solving one equation in one unknown 2.6 methods when derivatives are unavailable 2.7 minimization of a function of one variable 2.8 exercises 3 numerical linear algebra background 3.1 vector and matrix norms and orthogonality 3.2 solving systems of linear equations——matrix factorizations 3.3 errors in solving linear systems .3.4 updating matrix factorizations 3.5 eigenvalues and positive definiteness 3.6 linear least squares 3.7 exercises 4 multivariable calculus background 4.1 derivatives and multivariable models 4.2 multivariable finite-difference derivatives 4.3 necessary and sufficient conditions for unconstrained minimization 4.4 exercises 83 5 newton's method for nonlinear equations and unconstrained minimization 5.1 newton's method for systems of nonlinear equations 5.2 local convergence of newton's method 5.3 the kantorovich and contractive mapping theorems 5.4 finite-difference derivative methods for systems of nonlinear equations 5.5 newton's method for unconstrained minimization 5.6 finite-difference derivative methods for unconstrained minimization 5.7 exercises 6 globally convergent modifications of newton's method 6.1 the quasi-newton framework 6.2 descent directions 6.3 line searches 6.3.1 convergence results for properly chosen steps 6.3.2 step selection by backtracking 6.4 the model-trust region approach 6.4.1 the locally constrained optimal ("hook") step .. 6.4.2 the double dogleg step 6.4.3 updating the trust region 6.5 global methods for systems of nonlinear equations 6.6 exercises 7 stopping, scaling, and testing 7.1 scaling 7.2 stopping criteria 7.3 testing 7.4 exercises 8 secant methods for systems of nonlinear equations 8.1 broyden's method 8.2 local convergence analysis of broyden's method 8.3 implementation of quasi-newton algorithms using broyden's update 8.4 other secant updates for nonlinear equations 8.5 exercises 9 secant methods for unconstrained minimization 9.1 the symmetric secant update of powell 9.2 symmetric positive definite secant updates 9.3 local convergence of positive definite secant methods 9.4 implementation of quasi-newton algorithms using the positive definite secant update 9.5 another convergence result for the positive definite secant method 9.6 other secant updates for unconstrained minimization 9.7 exercises 10 nonlinear least squares 10.1 the nonlinear least-squares problem 10.2 gauss-newton-type methods 10.3 full newton-type methods 10.4 other considerations in solving nonlinear least-squares problems 10.5 exercises 11 methods for problems with special structure 11.1 the sparse finite-difference newton method 11.2 sparse secant methods 11.3 deriving least-change secant updates 11.4 analyzing least-change secant methods 11.5 exercises a appendix: a modular system of algorithms for unconstrained minimization and nonlinear equations (by robert schnabel) b appendix: test problems (by robert schnabei) references author index subject index ... |
内容加载中，请稍后...
商品评论（0条）