2013
DOI: 10.1016/j.cor.2012.11.008
|View full text |Cite
|
Sign up to set email alerts
|

A particle swarm–BFGS algorithm for nonlinear programming problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 29 publications
(11 citation statements)
references
References 27 publications
0
4
0
Order By: Relevance
“…This is the hurdle that the BFGS algorithm solves by looking up rows in the selected direction to determine the optimal distance to move. In-depth information about the BFGS algorithm can be found in studies such as those conducted by Wu et al (2020) and Nezhad et al (2013).…”
Section: Methodsmentioning
confidence: 99%
“…This is the hurdle that the BFGS algorithm solves by looking up rows in the selected direction to determine the optimal distance to move. In-depth information about the BFGS algorithm can be found in studies such as those conducted by Wu et al (2020) and Nezhad et al (2013).…”
Section: Methodsmentioning
confidence: 99%
“…The BFGS method represents the most efficacious quasi-Newton method used for unrestricted nonlinear schedules in the extensive area of nonlinear programming. In general, BFGS is different form the Newton method, where an assessment to Hessian matrix is assumed instead of the true Hessian Matrix H (Bazaraa et al, 2013;Nezhad et al, 2013). The minimization of the conventional Newton methods can be achieved by calculating the gradient as well as the Hessian matrix of subsequent derivatives when optimizing the function optimization.…”
Section: Broyden Fletcher Goldfarb Shanno Algorithmmentioning
confidence: 99%
“…As seen, the optimization models (15) and 17illustrate NP-hard mixed-integer nonlinear programming problems for which the classical methods are not practically efficient [12]. As known, metaheuristic algorithms have attracted special attention in developing efficiently robust computational procedures for solving a vast variety of such problems [38,24]. These nature-inspired methods are so popular since their softwares can be flexibly reused and also, they can efficiently solve complicated problems even in large scale cases [30,8,38].…”
Section: κ(A)mentioning
confidence: 99%