A Bayesian-optimization-based line search that keeps all past evaluations chooses step lengths and is claimed to converge with fewer function evaluations on CUTEst benchmarks.
IMA journal of numerical analysis 8(1), 141–148 (1988)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Information Preserving Line Search via Bayesian Optimization
A Bayesian-optimization-based line search that keeps all past evaluations chooses step lengths and is claimed to converge with fewer function evaluations on CUTEst benchmarks.