Inexact Restoration via random models for unconstrained noisy optimization
We study the Inexact Restoration framework with random models for minimizing functions whose evaluation is subject to errors. We propose a constrained formulation that includes well-known stochastic problems and an algorithm applicable when the evaluation of both the function and its gradient is random and a specified accuracy of such evaluations is guaranteed with sufficiently high probability. The proposed algorithm combines the Inexact Restoration framework with a trust-region methodology based on random first-order models. We analyse the properties of the algorithm and provide the expected number of iterations performed to reach an approximate first-order optimality point. Numerical experiments show that the proposed algorithm compares well with a state-of-the-art competitor.
Authors
- Simone Rebegoldi (ORCID: https://orcid.org/0000-0002-1232-5481)
- Benedetta Morini (ORCID: https://orcid.org/0000-0002-9213-3622)
Publication Details
- Journal
- Mathematics of Computation
- Published
- 2026-01-14
- DOI
- https://doi.org/10.1090/mcom/4197
- Primary Topic
- Stochastic Gradient Optimization Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00