2018
DOI: 10.1080/02331934.2018.1487423
|View full text |Cite
|
Sign up to set email alerts
|

A family of quasi-Newton methods for unconstrained optimization problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 19 publications
0
3
0
Order By: Relevance
“…( 1) Xt+ is the final location update operation. k A and k C ( 1,2,3) k = are similar to Eq. ( 2) and Eq.…”
Section: Huntingmentioning
confidence: 90%
See 1 more Smart Citation
“…( 1) Xt+ is the final location update operation. k A and k C ( 1,2,3) k = are similar to Eq. ( 2) and Eq.…”
Section: Huntingmentioning
confidence: 90%
“…Parameter estimation in the kinetics of SCWO is a complicated optimization problem with high-dimensional, nonlinear, and multiple local optimal solutions. Gradient-based optimization techniques, such as the Newton method [1], quasi-Newton method, and conjugation direction method [2], easily fall into local optima and are sensitive to initialization. Metaheuristic algorithms have become an effective solution used by scholars and scientists for confronting many problems due to their simple operations, higher efficiency and so on.…”
Section: Introductionmentioning
confidence: 99%
“…where x ∈ R n , and f: R n ⟶ R is a continuously differentiable function bounded from below. e quasi-Newton methods are currently used in countless optimization software for solving unconstrained optimization problems [1][2][3][4][5][6][7][8]. e BFGS method, one of the most efficient quasi-Newton methods, for solving (1) is an iterative method of the following form:…”
Section: Introductionmentioning
confidence: 99%