Birkhoff interpolation framework for arbitrary derivative-availability patterns in local polynomial models, with poisedness conditions, accuracy bounds, and a trust-region algorithm evaluated on CUTEst problems.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
math.OC 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
Introduces CLUSTER algorithm extending quadratic-interpolation trust-region methods to handle parameter-change costs, claiming ~50% performance gains on test problems and lab experiments plus an adapted convergence guarantee.
This paper isolates admissibility conditions for trust-region radius updates that guarantee first-order stationarity and O(ε^{-2}) complexity, verifies them across five mechanism classes, and extends prior frameworks with new convergence results under linear Hessian growth.
citing papers explorer
-
Birkhoff interpolation models for optimization with some available derivatives
Birkhoff interpolation framework for arbitrary derivative-availability patterns in local polynomial models, with poisedness conditions, accuracy bounds, and a trust-region algorithm evaluated on CUTEst problems.
-
CLUSTER: Derivative-free optimization of smooth functions with parameter-change costs
Introduces CLUSTER algorithm extending quadratic-interpolation trust-region methods to handle parameter-change costs, claiming ~50% performance gains on test problems and lab experiments plus an adapted convergence guarantee.
-
A survey of trust-region radius update mechanisms. Part I: First-order analysis
This paper isolates admissibility conditions for trust-region radius updates that guarantee first-order stationarity and O(ε^{-2}) complexity, verifies them across five mechanism classes, and extends prior frameworks with new convergence results under linear Hessian growth.