A new diagonal quasi-Newton algorithm for unconstrained optimization problems

Mahsa Nosrati; Keyvan Amini

Displaying similar documents to “A new diagonal quasi-Newton algorithm for unconstrained optimization problems”

Local Convergence Analysis for Partitioned Quasi-Newton Updates.

A. Griewank, P.L. Toint (1982)

Numerische Mathematik

Similarity:

Quasi-Newton's method with correction.

Herceg, Dragoslav, Krejić, Nataša, Lužanin, Zorana (1996)

Novi Sad Journal of Mathematics

Similarity:

Extra multistep BFGS updates in quasi-Newton methods.

Moghrabi, Issam A.R. (2006)

International Journal of Mathematics and Mathematical Sciences

Similarity:

A modified limited-memory BNS method for unconstrained minimization derived from the conjugate directions idea

Vlček, Jan, Lukšan, Ladislav

Similarity:

A modification of the limited-memory variable metric BNS method for large scale unconstrained optimization of the differentiable function $f : ℛ^{N} \to ℛ$ is considered, which consists in corrections (based on the idea of conjugate directions) of difference vectors for better satisfaction of the previous quasi-Newton conditions. In comparison with [11], more previous iterations can be utilized here. For quadratic objective functions, the improvement of convergence is the best one in some sense, all...

Newton-Kantorovich method and its global convergence.

Polyak, B.T. (2004)

Journal of Mathematical Sciences (New York)

Similarity:

On the Order of Convergence of Certain Quasi-Newton-Methods.

G. Schuller (1974/75)

Numerische Mathematik

Similarity:

Limited-memory variable metric methods that use quantities from the preceding iteration

Vlček, Jan, Lukšan, Ladislav

Similarity: