zbMATH — the first resource for mathematics

Quasi-inexact-Newton methods with global convergence for solving constrained nonlinear systems. (English) Zbl 0898.65024
The author presents a quasi-inexact-Newton algorithm for solving constrained nonlinear systems. The convergence properties of the algorithm are discussed.

65H10 Numerical computation of solutions to systems of equations
PDF BibTeX Cite
Full Text: DOI
[1] Dembo, R.S.; Eisenstat, S.C.; Steihaug, T., Inexact Newton methods, SIAM journal on numerical analysis, 14, 400-408, (1982) · Zbl 0478.65030
[2] Dennis, J.E.; Schnabel, R.B., Numerical methods for unconstrained optimization and nonlinear equations, (1983), Prentice-Hall Englewood Cliffs · Zbl 0579.65058
[3] Eisenstat, S.C.; Walker, H.F., Globally convergent inexact Newton methods, SIAM journal on optimization, 4, 393-422, (1994) · Zbl 0814.65049
[4] Fletcher, R., Practical methods of optimization, (1987), John Wiley and Sons Englewood Cliffs · Zbl 0905.65002
[5] Kozakevich, D.N.; Martínez, J.M.; Santos, S.A., Solving nonlinear systems of equations with simple constraints, () · Zbl 0896.65041
[6] Martínez, J.M., Local convergence theory for inexact Newton methods based on structural least-change updates, Mathematics of computation, 55, 143-168, (1990)
[7] Martínez, J.M., A theory of secant preconditioned, Mathematics of computation, 60, 681-698, (1993) · Zbl 0779.65034
[8] Martínez, J.M., An extension of the theory of secant preconditioners, Journal of computational and applied mathematics, 60, 115-125, (1994) · Zbl 0925.65092
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.