Metraipolis › archive › dc_d140747bec15
Adaptive Sampling Trust Region Optimization for Derivative-free Stochastic Functions and Deterministic Equality Constraints — arXiv:2608.15894
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.15894
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T20:17:43.873Z
- SHA-256 of the archived text
fbc95f12c99d1fe3e9b0a97f45f2c3ee785cb1c78cd6adaa0f334612cead9ff5- Stable URL of this page
https://metraipolis.com/documento/dc_d140747bec15
How to cite
Adaptive Sampling Trust Region Optimization for Derivative-free Stochastic Functions and Deterministic Equality Constraints — arXiv:2608.15894 — arXiv (en), https://arxiv.org/abs/2608.15894 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d140747bec15 (Metraipolis archive dc_d140747bec15, sha256 fbc95f12c99d1fe3e9b0a97f45f2c3ee785cb1c78cd6adaa0f334612cead9ff5)
BibTeX
@misc{dcd140747bec15,
title = {Adaptive Sampling Trust Region Optimization for Derivative-free Stochastic Functions and Deterministic Equality Constraints — arXiv:2608.15894},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.15894},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d140747bec15; sha256 fbc95f12c99d1fe3e9b0a97f45f2c3ee785cb1c78cd6adaa0f334612cead9ff5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.15894. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study optimization problems with noisy zeroth-order objective observations and deterministic nonlinear equality constraints with available derivatives. We propose a constrained variant of the adaptive-sampling trust-region derivative-free optimization algorithm---ASTRO-DF. The method builds quadratic local models from estimated objective values at interpolation points within a moving trust region and promotes feasibility through a Byrd--Omojokun composite-step based on linearized constraints, following an SQP-like framework. We prove almost sure convergence using a new constrained criticality test and present numerical results on an equality-constrained stochastic activity network problem. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-18 in math.OC). Categorie arXiv: Optimization and Control (math.OC) ; Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2608.15894 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T19:45:07.845Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).