Birkhoff interpolation models for optimization with some available derivatives
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916067664723968 |
|---|---|
| author | Larson, Jeffrey Menickelly, Matt Toler, Evan |
| author_facet | Larson, Jeffrey Menickelly, Matt Toler, Evan |
| contents | We consider interpolation-based derivative-free optimization in settings where only some derivatives are available. Such situations arise in scientific computing applications involving simulations, adjoint-enabled components, legacy software, or partially differentiable models. We introduce a Birkhoff interpolation framework that permits arbitrary patterns of derivative availability and enables the construction of local polynomial models using mixtures of function values and partial derivative information. In contrast to Hermite interpolation approaches, the proposed framework does not require all available derivatives to be queried at every interpolation point. We develop conditions under which the resulting interpolation systems are poised and establish corresponding model-accuracy bounds for fully quadratic interpolation models. We develop a trust-region framework that maintains poised interpolation sets while selectively incorporating derivative information. The method generalizes an established class of interpolation-based derivative-free optimization algorithms and naturally bridges derivative-free and derivative-based settings. We evaluate our approach on a collection of CUTEst test problems with synthetically generated derivative-availability patterns. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_28503 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Birkhoff interpolation models for optimization with some available derivatives Larson, Jeffrey Menickelly, Matt Toler, Evan Optimization and Control 68Q25, 90C56, 41A05 We consider interpolation-based derivative-free optimization in settings where only some derivatives are available. Such situations arise in scientific computing applications involving simulations, adjoint-enabled components, legacy software, or partially differentiable models. We introduce a Birkhoff interpolation framework that permits arbitrary patterns of derivative availability and enables the construction of local polynomial models using mixtures of function values and partial derivative information. In contrast to Hermite interpolation approaches, the proposed framework does not require all available derivatives to be queried at every interpolation point. We develop conditions under which the resulting interpolation systems are poised and establish corresponding model-accuracy bounds for fully quadratic interpolation models. We develop a trust-region framework that maintains poised interpolation sets while selectively incorporating derivative information. The method generalizes an established class of interpolation-based derivative-free optimization algorithms and naturally bridges derivative-free and derivative-based settings. We evaluate our approach on a collection of CUTEst test problems with synthetically generated derivative-availability patterns. |
| title | Birkhoff interpolation models for optimization with some available derivatives |
| topic | Optimization and Control 68Q25, 90C56, 41A05 |
| url | https://arxiv.org/abs/2605.28503 |