1970
DOI: 10.1093/comjnl/13.3.317
|View full text |Cite
|
Sign up to set email alerts
|

A new approach to variable metric algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

5
1,491
0
32

Year Published

1990
1990
2008
2008

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 3,452 publications
(1,594 citation statements)
references
References 0 publications
5
1,491
0
32
Order By: Relevance
“…In all techniques, Bmax and other model parameters were fitted using a system for function optimization (James and Roos, 1976). The simplex algo rithm (NeIder and Mead, 1965) and subsequently the vari able metric method of Fletcher (1970) were used as opti mization techniques. The simplex method of NeIder and Mead is rather insensitive to local minima, statistical, and rounding errors.…”
Section: Discussionmentioning
confidence: 99%
“…In all techniques, Bmax and other model parameters were fitted using a system for function optimization (James and Roos, 1976). The simplex algo rithm (NeIder and Mead, 1965) and subsequently the vari able metric method of Fletcher (1970) were used as opti mization techniques. The simplex method of NeIder and Mead is rather insensitive to local minima, statistical, and rounding errors.…”
Section: Discussionmentioning
confidence: 99%
“…Os modelos foram obtidos a partir dos dados cristalográficos 31 . Os parâmetros geométricos das moléculas de CO, CO 2 e NH 3 foram totalmente otimizados, utilizando o algoritmo Broyden-Fletcher-Goldfarb-Shanno (BFGS) [63][64][65][66] , enquanto que os parâmetros geométricos do "cluster" foram mantidos congelados. Os efeitos da otimização não deixam de ser importantes, entretanto, os modelos estudados têm grande número de áto-mos e, conseqüentemente, elevado grau de liberdade.…”
Section: Modelos E Métodosunclassified
“…Quasi-Newton methods for unconstrained optimization are important computational tools in many scientific fields and are a standard subject in textbooks on computation. The BFGS method, proposed individually in [6], [14], [20], and [30], is implemented in most optimization software and is widely recognized as efficient. Generalizations of BFGS are available for large problems with memory limitations, for problems with bound constraints, and for a parallel computing environment.…”
Section: Ams Subject Classifications 65k10 90c53mentioning
confidence: 99%
“…This is known as DFP [13], [18] and is generally regarded as inferior to BFGS. Fletcher [14] advocated restricting attention to Broyden updates that are convex combinations of the BFGS and DFP updates because such updates satisfy a monotone eigenvalue property when used to minimize quadratic functions. Recently, however, various choices of negative Broyden parameters (φ k < 0 corresponding to λ k < 1) have been studied.…”
Section: Historical Developments Crockett and Chernoffmentioning
confidence: 99%