On the worst-case evaluation complexity of non-monotone line search algorithms.
Geovani Nunes GrapigliaEkkehard W. SachsPublished in: Comput. Optim. Appl. (2017)
Keyphrases
- worst case
- search algorithm
- upper bound
- space complexity
- average case
- complexity bounds
- lower bound
- np hard
- running times
- evaluation method
- evaluation criteria
- satisfiability problem
- worst case analysis
- search problems
- evaluation methods
- gold standard
- case study
- greedy algorithm
- theoretical analysis
- special case
- image sequences