Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,115,678 papers from all fields of science
Search
Sign In
Create Free Account
Broyden–Fletcher–Goldfarb–Shanno algorithm
Known as:
BFGS
, Broydon-Fletcher-Goldfarb-Shanno
, BFGS method
Expand
In numerical optimization, the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm is an iterative method for solving unconstrained nonlinear…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
25 relations
Approximation theory
Berndt–Hall–Hall–Hausman algorithm
Broyden's method
Davidon–Fletcher–Powell formula
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Broyden-Fletcher-Goldfarb-Shanno algorithm based on new quasi-Newton equation
Chu Tian-ding
2012
Corpus ID: 124146222
Based on the error analysis of the Taylor expansion,a new model for improving the quadratic model is put forward,and the new…
Expand
Highly Cited
2007
Highly Cited
2007
Exponentiated gradient algorithms for log-linear structured prediction
A. Globerson
,
Terry Koo
,
Xavier Carreras
,
M. Collins
International Conference on Machine Learning
2007
Corpus ID: 11226500
Conditional log-linear models are a commonly used method for structured prediction. Efficient learning of parameters in these…
Expand
2003
2003
Extension of Quasi-Newton Methods to Mathematical Programs with Complementarity Constraints
Houyuan Jiang
,
D. Ralph
Computational optimization and applications
2003
Corpus ID: 2117477
Quasi-Newton methods in conjunction with the piecewise sequential quadratic programming are investigated for solving mathematical…
Expand
2001
2001
Design of linear phase IIR filters via weighted least-squares approximation
Chengshan Xiao
,
J. Olivier
,
P. Agathoklis
IEEE International Conference on Acoustics…
2001
Corpus ID: 16068595
A new method for designing IIR digital filters with linear phase in the passband is proposed. This method is based on frequency…
Expand
Highly Cited
1997
Highly Cited
1997
Limited-memory matrix methods with applications
T. Kolda
1997
Corpus ID: 60962054
The focus of this dissertation is on matrix decompositions that use a limited amount of computer memory, thereby allowing…
Expand
1997
1997
Nonlinear PLS modelling using radial basis functions
D. Wilson
,
G. Irwin
,
G. Lightbody
Proceedings of the American Control Conference…
1997
Corpus ID: 62241774
An approach to nonlinear partial least squares (PLS) modelling using radial basis function (RBF) neural networks to provide a…
Expand
1991
1991
Parallel-vector computation for linear structural analysis and non-linear unconstrained optimization problems
D. T. Nguyen
,
O. Storaasli
,
+4 authors
T. Agarwal
1991
Corpus ID: 62543840
1990
1990
Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms
K. A. Ariyawansa
Mathematical programming
1990
Corpus ID: 45100755
This paper is concerned with collinear scaling algorithms for unconstrained minimization where the underlying local approximants…
Expand
1989
1989
Nonlinear parameter estimation experiments for static load modelling in electric power systems
L. G. Dias
,
M. El-Hawary
1989
Corpus ID: 62149028
In the paper, we consider the problem of estimating the parameters of static power system load models intended for use in load…
Expand
Highly Cited
1986
Highly Cited
1986
A general-purpose optimization program for engineering design
G. Vanderplaats
,
H. Sugimoto
1986
Corpus ID: 62121790
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE