Results 231 to 240 of about 39,793 (262)

Quasi-Newton parallel geometry optimization methods

The Journal of Chemical Physics, 2010
Algorithms for parallel unconstrained minimization of molecular systems are examined. The overall framework of minimization is the same except for the choice of directions for updating the quasi-Newton Hessian. Ideally these directions are chosen so the updated Hessian gives steps that are same as using the Newton method.
Steven K, Burger, Paul W, Ayers
openaire   +2 more sources

Quasi-Newton Methods, Motivation and Theory [PDF]

SIAM Review, 1977
This paper is an attempt to motivate and justify quasi-Newton methods as useful modifications of Newton's method for general and gradient nonlinear systems of equations. References are given to ample numerical justification; here we give an overview of many of the important theoretical results and each is accompanied by sufficient discussion to make ...
Dennis, J. E. jun., More, Jorge J.
exaly   +4 more sources

Quasi-newton algorithms generate identical points

Mathematical Programming, 1972
Four theorems are presented that indicate that the sequence of points generated by different members of Broyden's (1967) family are identical, if the linear search routine is accurate.
openaire   +1 more source

Quasi- Newton Methods for Nonlinear Equations

Journal of the ACM, 1968
A unified derivation is presented of the quasi-Newton methods for solving systems of nonlinear equations. The general algorithm contains, as special cases, all of the previously proposed quasi-Newton methods.
openaire   +2 more sources

A Classification of Quasi-Newton Methods

Numerical Algorithms, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Cancellation Errors in Quasi-Newton Methods

SIAM Journal on Scientific and Statistical Computing, 1986
Using a probabilistic estimate, the author gives the effect of cancellation on the performance of quasi-Newton methods. First, the author describes and shows that the size of the low rank correction can be measured for the BFGS method. This BFGS method is used to find a local solution \(x^*\) of the problem: minimize f(x), \(x\in {\mathbb{R}}^ n ...
openaire   +2 more sources

Quasi-Newton Methods

2023
Luigi Grippo, Marco Sciandrone
openaire   +1 more source

Quasi-Newton Methods

2006
  +5 more sources

Partial-Quasi-Newton Methods

Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2022
Chengchang Liu, Shuxian Bi, Luo Luo, John C.S. Lui   +3 more
openaire   +1 more source

Quasi-Newton methods for saddlepoints

Journal of Optimization Theory and Applications, 1985
The well-known quadratically convergent methods of the Huang type [cf. \textit{H. Y. Huang}, ibid. 5, 405-423 (1970; Zbl 0184.202) and \textit{H. Y. Huang} and \textit{A. V. Levy}, ibid. 6, 269-282 (1970; Zbl 0187.404)] to maximize or minimize a function \(f: {\mathbb{R}}^ n\to {\mathbb{R}}\) are generalized to find saddlepoints of f.
openaire   +2 more sources