Theoretical efficiency of an inexact Newton method

Journal of Optimization Theory and Applications

Volumn 105, Issue 1, 2000, Pages 97-112

  Deng, N Y ^a   Wang, Z Z ^b  

^a CHINA AGRICULTURAL UNIVERSITY   (China)

^b UNIVERSITY OF GREENWICH   (United Kingdom)

Author keywords

Choleski factorization; Newton method; Preconditioned conjugate gradient iteration; Unconstrained optimization

Indexed keywords

CONJUGATE GRADIENT METHOD; FACTORIZATION; INVERSE PROBLEMS; OPTIMIZATION;

CHOLESKI; CHOLESKI FACTORIZATION; CONJUGATE GRADIENT ITERATION; INEXACT NEWTON METHOD; LOCAL ALGORITHM; NEWTON'S METHODS; ORDER 2; PRECONDITIONED CONJUGATE GRADIENT ITERATION; UNCONSTRAINED OPTIMIZATION; UNCONSTRAINED OPTIMIZATION PROBLEMS;

NEWTON-RAPHSON METHOD;

EID: 0034349261     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1004614012113     Document Type: Article

References (20)

1. 1. DIXON, L. C. W., On the Deng-Wang Theorems, Personal Communication 1998.
2. 2. DENNIS, J. E., and SCHNABLE, R. B., Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice Hall, Englewood Cliffs, New Jersey, 1983.
3. 3. GILL, P. E., MURRAY, W., and WRIGHT, M. H., Practical Optimization Academic Press, London, England, 1981.
4. 4. CONN, A. R., GOULD, N. I. M., and TOINT, P. L., Numerical Experiments will the LANCELOT Package (Release A) for Large-Scale Nonlinear Optimization Technical Report 92-075, Rutherford Appleton Laboratory, Chilton, England 1992.
5. 5. ARIOLI, M., CHAN, T. F., DUFF, I. S., GOULD, N. I. M., and REID, J. K. Computing a Search Direction for Large-Scale Linearly Constrained Nonlinear Optimization Calculations, Technical Report TR/PA/93/94, CERFACS Toulouse, France, 1993.
6. 6. BOUARICHA, A., and MORE, J. J., A Preconditioned Newton Method for Large Scale Optimization, Paper Presented at the Workshop on Linear Algebra in Optimization, Albi, France, 1996.
7. 7. DENG, N. Y., XIAO, Y., and ZHOU, F. J., Nonmonotonic Trust-Region Algorithm, Journal of Optimization Theory and Applications, Vol. 76, pp. 259-285 1993.
8. 8. DIXON, L. C. W., and PRICE, R. C., Numerical Experience with the Truncated Newton Method for Unconstrained Optimization, Journal of Optimization Theory and Applications, Vol. 56, pp. 245-255, 1988.
9. 9. EISENSTAT, S. C., and WALKER, H. F., Choosing the Forcing Terms in an Inexact Newton Method, SIAM Journal on Scientific Computing, Vol. 17 pp. 33-46, 1996.
10. 10. NASH, S. G., Preconditioning of Truncated-Newton Methods, SIAM Journal on Scientific and Statistical Computing, Vol. 6, pp. 599-616, 1985.
11. 11. NOCEDAL, S. G., Large-Scale Unconstrained Optimization, DEECS Report, Northwestern University, 1996.
12. 12. STEIHAUG, T., The Conjugate Gradient Method and Trust Regions in Large-Scale Optimization, SIAM Journal on Numerical Analysis, Vol. 20, pp. 626-637, 1983.
13. 13. TOINT, P. L., Toward an Efficient Sparsity-Exploiting Newton Method for Minimization, Sparse Matrices and Their Uses, Edited by I. S. Duff, Academic Press, London, England, pp. 57-88, 1981.
14. 14. KELLEY, C. T., Iterative Methods for Linear and Nonlinear Equations, SIAM, Philadelphia, Pennsylvania, 1995.
15. 15. DENG, N. Y., and WANG, Z. Z., Can Newton Method Be Surpassed?, Chinese Science Bulletin, Vol. 44, pp. 132-134, 1999.
16. 16. ORTEGA, J. M., and RHEINBOLDT, W. C., Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, London, England, 1970.
17. 17. DEMBO, R., EISENSTAT, S., and STEIHUAG, T., Inexact Newton Method, SIAM Journal on Numerical Analysis, Vol. 19, pp. 400-408, 1982.
18. 18. AXELSSON, O., Iterative Solution Method, Cambridge University Press, Cambridge, England, 1996.
19. 19. DENG, N. Y., and WANG, Z. Z., Newton Method Can Be Beaten, Quaderno DMSIA 9, University of Bergamo, Bergamo, Italy, 1998.
20. 20. DANIEL, J. W., The Conjugate Gradient Method for Linear and Nonlinear Operator Equations, SIAM Journal on Numerical Analysis, Vol. 4, pp. 10-26, 1967.