Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations

Optimization Methods and Software

Volumn 8, Issue 3-4, 1998, Pages 201-223

  Luksan L ^a   Vlcek J ^a  

^a INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

Armijo type descent methods; Computational experiments; Conjugate gradient type methods; Global convergence; Inexact methods; Newton like methods; Nonlinear equations; Nonsymmetric linear systems; Residual smoothing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; PROBLEM SOLVING;

ARMIJO-TYPE DESCENT METHODS; COMPUTATIONAL EXPERIMENTS; CONJUGATE GRADIENT METHODS; GLOBAL CONVERGENCE; INEXACT METHODS; NEWTON-LIKE METHODS; NONSYMMETRIC LINEAR EQUATION; RESIDUAL SMOOTHING;

NONLINEAR EQUATIONS;

EID: 0031651231     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789808805677     Document Type: Article

References (4)

1. Averick, B. M., Carter, R. G. and More, J. J. (1991). The Minpack-2 Test Problem Collection, Research Report No. ANL/MCS-TM-150, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne.
2. Alefeld, G., Gienger, A. and Potra, F. (1994). Efficient Validation of Solutions of Nonlinear Systems, SIAM Journal on Numerical Analysis, 31, pp. 252-260.
3. Bing, Y. and Lin, G. (1991). An Efficient Implementation of Merrill's Method for Sparse of Partially separable systems of Nonlinear Equations, SIAM Journal on Optimization, 2, pp. 206-221.
4. Bogle, I. D. L. and Perkins, J. D. (1990). A New Sparsity Preserving Quasi-Newton Update for Solving Nonlinear Equations, SIAM Journal on Scientific and Statistical Computations, 11, pp. 621-630.