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

An adaptive nonmonotone line search for multiobjective 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

2022
2022
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 30 publications
0
3
0
Order By: Relevance
“…The best value is defined as the squirrel on the pecan tree, the three of the next best values are the squirrels on the oak trees, and the rest values are the squirrels on the normal trees. While (the stopping criterion is not satisfied) do For t = 1 to n Update flying squirrel locations which are on oak trees and moving towards pecan trees using Equation (3) Update flying squirrel locations which are on normal trees and moving towards oak trees using Equation (4) Evaluate the fitness of each flying squirrel's location. Update flying squirrel locations which are on normal trees and moving towards pecan trees using Equation (5) Evaluate the fitness of each flying squirrel location.…”
Section: Beginmentioning
confidence: 99%
See 1 more Smart Citation
“…The best value is defined as the squirrel on the pecan tree, the three of the next best values are the squirrels on the oak trees, and the rest values are the squirrels on the normal trees. While (the stopping criterion is not satisfied) do For t = 1 to n Update flying squirrel locations which are on oak trees and moving towards pecan trees using Equation (3) Update flying squirrel locations which are on normal trees and moving towards oak trees using Equation (4) Evaluate the fitness of each flying squirrel's location. Update flying squirrel locations which are on normal trees and moving towards pecan trees using Equation (5) Evaluate the fitness of each flying squirrel location.…”
Section: Beginmentioning
confidence: 99%
“…Over time, scholars have developed many methods to deal with optimization problems. These methods include the Gradient Descent Optimizer [1,2], Line Search Algorithm [3,4], and Trust Region Algorithm [5,6], among others. However, as problems become increasingly complex, traditional methods face challenges when confronted with optimization problems that involve intricate constraints and complicated calculation processes.…”
Section: Introductionmentioning
confidence: 99%
“…For an introduction to multi‐objective programming see References 6‐8. For more some recent new works and surveys of recent developments on multi‐objective optimization problems, one can also see References 9‐18.…”
Section: Introductionmentioning
confidence: 99%