Fully adaptive zeroth-order method for minimizing functions with compressible gradients

DOI10.1007/S10957-025-02860-9MaRDI QIDQ6910562zbMATH OpenFDO

Authors Geovani Nunes Grapiglia, Daniel McKenzie

Publication date 29 October 2025

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

Full work available at URL https://doi.org/10.1007/S10957-025-02860-9

zbMATH Keywords

black-box optimizationcompressible gradientsderivative-free optimizationworst-case complexityzeroth-order optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)

Cites work

• A dimensionality reduction technique for unconstrained global optimization of functions with low effective dimensionality
• A one-bit, comparison-based gradient estimator
• A simple proof of the restricted isometry property for random matrices
• A Simplex Method for Function Minimization
• A stochastic subspace approach to gradient-free optimization in high dimensions
• Bayesian optimization in a billion dimensions via random embeddings
• Benchmarking Derivative-Free Optimization Algorithms
• Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings
• Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Design for low-temperature microwave-assisted crystallization of ceramic thin films
• Direct Search Based on Probabilistic Descent in Reduced Spaces
• scientific article; zbMATH DE number 6276119 (Why is no real title available?)
• On the numerical performance of finite-difference-based methods for derivative-free optimization
• Quadratic regularization methods with finite-difference gradient approximations
• Random gradient-free minimization of convex functions
• Scalable subspace methods for derivative-free nonlinear least-squares optimization
• Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
• Stochastic three points method for unconstrained smooth minimization
• Testing Unconstrained Optimization Software
• The NEWUOA software for unconstrained optimization without derivatives
• Worst-case evaluation complexity of a derivative-free quadratic regularization method
• Zeroth-order optimization with orthogonal random directions
• Zeroth-order regularized optimization (ZORO): approximately sparse gradients and adaptive sampling

This page was built for publication: Fully adaptive zeroth-order method for minimizing functions with compressible gradients

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