An optimally fast objective-function-free minimization algorithm using random subspaces

DOI10.1007/S10957-026-03004-3MaRDI QIDQ7254857zbMATH OpenFDO

Authors Stefania Bellavia, Serge Gratton, Benedetta Morini, Philippe L. Toint

Publication date 29 May 2026

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10957-026-03004-3

zbMATH Keywords

sketchingnonlinear optimizationevaluation complexityobjective-function-free optimization (OFFO)stochastic adaptive regularisation methods

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Calculus of variations and optimal control; optimization (49-XX)

Cites work

• scientific article; zbMATH DE number 107545 (Why is no real title available?)
• A stochastic first-order trust-region method with inexact restoration for finite-sum minimization
• Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
• Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives
• Adaptive regularization minimization algorithms with nonsmooth norms
• Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization
• Adaptive subgradient methods for online learning and stochastic optimization
• An adaptive trust-region method without function evaluations
• An elementary proof of a theorem of Johnson and Lindenstrauss
• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
• Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an \(\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}\) Complexity Bound
• Evaluation complexity of algorithms for nonconvex optimization. Theory, computation and perspectives
• Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise
• Inexact Gauss-Newton methods with matrix approximation by sampling for nonlinear least-squares and systems
• Numerical Optimization
• Partitioned variable metric updates for large structured optimization problems
• Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
• Sketching as a tool for numerical linear algebra
• Stochastic trust-region algorithm in random subspaces with convergence and expected complexity analyses

This page was built for publication: An optimally fast objective-function-free minimization algorithm using random subspaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7254857)