Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bellavia, S., Gratton, S., Morini, B., Toint, Ph. L.
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control 60G99, 65K05, 68M20, 68Q17, 90C26 G.6.1; F.2.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization
by: Bellavia, S., et al.
Published: (2025)

Iteration complexity of the Difference-of-Convex Algorithm for unconstrained optimization: a simple proof
by: Gratton, Serge, et al.
Published: (2026)

An objective-function-free algorithm for general smooth constrained optimization
by: Bellavia, S., et al.
Published: (2026)

When can forward stable algorithms be composed stably?
by: Beltrán, Carlos, et al.
Published: (2021)

A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity
by: Gratton, Serge, et al.
Published: (2024)

Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $o(ε^{-2})$ rather than $\mathcal{O}(ε^{-2})$
by: Gratton, Serge, et al.
Published: (2024)

Examples of slow convergence for adaptive regularization optimization methods are not isolated
by: Toint, Philippe L.
Published: (2024)

Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization
by: Gratton, Serge, et al.
Published: (2025)

S2MPJ and CUTEst optimization problems for Matlab, Python and Julia
by: Gratton, Serge, et al.
Published: (2024)

A Classical-Quantum Hybrid Architecture for Physics-Informed Neural Networks
by: Lantigua, Said, et al.
Published: (2025)

Complexity and performance for two classes of noise-tolerant first-order algorithms
by: Gratton, S., et al.
Published: (2022)

prunAdag: an adaptive pruning-aware gradient method
by: Porcelli, Margherita, et al.
Published: (2025)

An objective-function-free algorithm for nonconvex stochastic optimization with deterministic equality and inequality constraints
by: Gratton, S., et al.
Published: (2026)

What is a POLYNOMIAL-TIME Computable L2-Function?
by: Bacho, Aras, et al.
Published: (2026)

A unified convergence theory for adaptive first-order methods in the nonconvex case, including AdaNorm, full and diagonal AdaGrad, Shampoo and Muo
by: Gratton, S., et al.
Published: (2026)

Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
by: Gratton, Serge, et al.
Published: (2024)

Barrier Algorithms for Constrained Non-Convex Optimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

Which graph motif parameters count?
by: Bläser, Markus, et al.
Published: (2025)

PDE-DKL: PDE-constrained deep kernel learning in high dimensionality
by: Yan, Weihao, et al.
Published: (2025)

Online minimum search for a Brownian bridge
by: Wu, Erik, et al.
Published: (2024)

Simultaneously optimizing symmetry shifts and tensor factorizations for cost-efficient Fault-Tolerant Quantum Simulations of electronic Hamiltonians
by: Deka, Konrad, et al.
Published: (2024)

Fast Evaluation of Truncated Neumann Series by Low-Product Radix Kernels
by: Sao, Piyush
Published: (2026)

Gelation in input-driven aggregation
by: Krapivsky, P. L., et al.
Published: (2024)

TriP: A Triangle Puzzle Approach to Robust Translation Averaging
by: Fan, Zhekai, et al.
Published: (2026)

Hybrid LLM and Higher-Order Quantum Approximate Optimization for CSA Collateral Management
by: Jin, Tao, et al.
Published: (2025)

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms
by: Bhamidi, Shankar, et al.
Published: (2025)

Autoregressive regularized score-based diffusion models for multi-scenarios fluid flow prediction
by: Genuist, Wilfried, et al.
Published: (2025)

Cycle-Sync: Robust Global Camera Pose Estimation through Enhanced Cycle-Consistent Synchronization
by: Li, Shaohan, et al.
Published: (2025)

On the Average Runtime of an Open Source Binomial Random Variate Generation Algorithm
by: Cicirello, Vincent A.
Published: (2024)

Learning Hamiltonian flows from numerical integrators and examples
by: Fang, Rui, et al.
Published: (2025)

Stochastic convergence of parallel asynchronous adaptive first-order methods
by: Gratton, Serge, et al.
Published: (2026)

On (In)approximability of MaxMin Independent Set Reconfiguration
by: Hoang, Hung P., et al.
Published: (2026)

Quantum walk informed variational algorithm design
by: Matwiejew, Edric, et al.
Published: (2024)

Fast Expectation Value Calculation Speedup of Quantum Approximate Optimization Algorithm: HoLCUs QAOA
by: Ali, Alejandro Mata
Published: (2025)

Quantum Discrete Variable Representations
by: Pliś, Szymon, et al.
Published: (2025)

Escaping Saddle Points via Curvature-Calibrated Perturbations: A Complete Analysis with Explicit Constants and Empirical Validation
by: Alpay, Faruk, et al.
Published: (2025)

On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
by: Emmerich, Michael T. M., et al.
Published: (2026)

Learning a robust shape parameter for RBF approximation
by: Veiga, Maria Han, et al.
Published: (2024)

Generating DDPM-based Samples from Tilted Distributions
by: Mandal, Himadri, et al.
Published: (2026)

Latent Twins
by: Chung, Matthias, et al.
Published: (2025)