EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity

Serge Gratton, Sadok Jerad, Philippe L. Toint

Open Journal of Mathematical Optimization · 20.05.2025 · 6 · 1-24

DOI: 10.5802/ojmo.41 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Open Journal of Mathematical Optimization, online erschienen am 20.05.2025. Verfasst von Serge Gratton und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 51 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A fully stochastic pth-order adaptive-regularization method for unconstrained nonconvex optimization is presented which never computes the objective-function value, but yet achieves the optimal 𝒪 ( ϵ - ( p + 1 ) / p ) complexity bound for finding first-order critical points. When stochastic gradients and Hessians are considered, we recover the optimal 𝒪 ϵ - 3 / 2 bound for finding first-order critical points. The method is noise-tolerant and the inexactness conditions required for convergence depend on the history of past steps. Applications to cases where derivative evaluation is inexact and to minimization of finite sums by sampling are discussed. Numerical experiments on large binary classification problems illustrate the potential of the new method.

Zitieren

APA

Gratton, S., Jerad, S., & Toint, P. L. (2025). A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity. Open Journal of Mathematical Optimization, 6, 1-24. https://doi.org/10.5802/ojmo.41

Vancouver

Gratton S, Jerad S, Toint PL. A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity. Open Journal of Mathematical Optimization. 2025;6:1-24. doi:10.5802/ojmo.41

BibTeX
@article{Gratton2025,
  author = {Gratton, Serge and Jerad, Sadok and Toint, Philippe L.},
  title = {A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity},
  journal = {Open Journal of Mathematical Optimization},
  year = {2025},
  volume = {6},
  pages = {1--24},
  doi = {10.5802/ojmo.41}
}
Kostenlos starten →