Efficient trust region method for nonlinear least squares
Ladislav Lukšan (1996)
Kybernetika
Similarity:
Ladislav Lukšan (1996)
Kybernetika
Similarity:
El-Alem, Mahmoud M., Abdel-Aziz, Mohammedi R., El-Bakry, Amr S. (2001)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Jonas Koko (2004)
International Journal of Applied Mathematics and Computer Science
Similarity:
Newton's iteration is studied for the numerical solution of an elliptic PDE with nonlinear boundary conditions. At each iteration of Newton's method, a conjugate gradient based decomposition method is applied to the matrix of the linearized system. The decomposition is such that all the remaining linear systems have the same constant matrix. Numerical results confirm the savings with respect to the computational cost, compared with the classical Newton method with factorization at each...
Laureano F. Escudero (1982)
Qüestiió
Similarity:
We present an algorithm for supra-scale linearly constrained nonlinear programming (LNCP) based on the Limited-Storage Quasi-Newton's method. In large-scale programming solving the reduced Newton equation at each iteration can be expensive and may not be justified when far from a local solution; besides, the amount of storage required by the reduced Hessian matrix, and even the computing time for its Quasi-Newton approximation, may be prohibitive. An alternative based on the reduced...
Ladislav Lukšan (1982)
Kybernetika
Similarity: