Adaptive cubic regularization methods with dynamic inexact Hessian information and applications to finite-sum minimization
From MaRDI portal
Publication:4964100
DOI10.1093/imanum/drz076zbMath1460.65076arXiv1808.06239OpenAlexW3023674141MaRDI QIDQ4964100
Benedetta Morini, Gianmarco Gurioli, Stefania Bellavia
Publication date: 24 February 2021
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.06239
Related Items (14)
Stochastic analysis of an adaptive cubic regularization method under inexact gradient evaluations and dynamic Hessian accuracy ⋮ A cubic regularization of Newton's method with finite difference Hessian approximations ⋮ Subsampled nonmonotone spectral gradient methods ⋮ Inexact restoration with subsampled trust-region methods for finite-sum minimization ⋮ A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization ⋮ A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization ⋮ The impact of noise on evaluation complexity: the deterministic trust-region case ⋮ An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity ⋮ A generalized worst-case complexity analysis for non-monotone line searches ⋮ Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives ⋮ Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization ⋮ Linesearch Newton-CG methods for convex optimization with noise ⋮ A stochastic first-order trust-region method with inexact restoration for finite-sum minimization ⋮ LSOS: Line-search second-order stochastic optimization methods for nonconvex finite sums
This page was built for publication: Adaptive cubic regularization methods with dynamic inexact Hessian information and applications to finite-sum minimization
