Quasi-Newton methods without projections for unconstrained minimization
Ladislav Lukšan (1982)
Kybernetika
Similarity:
Displaying similar documents to “Some notes on the quasi-Newton methods”
Quasi-Newton methods without projections for unconstrained minimization
Quasi-Newton methods without projections for linearly constrained minimization
Ladislav Lukšan (1982)
Kybernetika
Similarity:
Quasi-Newton type of diagonal updating for the L-BFGS method.
Sahari, M.L., Khaldi, R. (2009)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Extra multistep BFGS updates in quasi-Newton methods.
Moghrabi, Issam A.R. (2006)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Quasi-Newton gradient method with analytical determination of the direction and length of step
Peter Hudzovič (1988)
Kybernetika
Similarity:
On diagonally-preconditioning the truncated-Newton method for super-scale linearly constrained nonlinear programming.
Laureano F. Escudero (1982)
Qüestiió
Similarity:
We present an algorithm for super-scale linearly constrained nonlinear programming (LCNP) based on Newton's method. In large scale programming solving Newton's equation at each iteration can be expensive and may not be justified when far from a local solution; we briefly review the current existing methodologies, such that by classifying the problems in small-scale, super-scale and supra-scale problems we suggest the methods that, based on our own computational experience, are more suitable...
On the convergence of a Newton-like method in and the use of Berinde's exit criterion.
Sen, Rabindranath, Mukherjee, Sulekha, Patra, Rajesh (2006)
International Journal of Mathematics and Mathematical Sciences
Similarity: