Curvature-aware derivative-free optimization
From MaRDI portal
Cites work
- A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
- A dimensionality reduction technique for unconstrained global optimization of functions with low effective dimensionality
- A one-bit, comparison-based gradient estimator
- A Simplex Method for Function Minimization
- A stochastic subspace approach to gradient-free optimization in high dimensions
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization
- Adaptive stochastic approximation by the simultaneous perturbation method
- Benchmarking optimization software with performance profiles.
- Convergence estimates for iterative minimization methods
- Cubic regularization of Newton method and its global performance
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Derivative-free optimization methods
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Global convergence and stabilization of unconstrained minimization methods without derivatives
- Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise
- Global optimization using random embeddings
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- scientific article; zbMATH DE number 3431710 (Why is no real title available?)
- scientific article; zbMATH DE number 6276119 (Why is no real title available?)
- Introduction to Derivative-Free Optimization
- Lazy queries can reduce variance in zeroth-order optimization
- Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
- Nonmonotone derivative-free methods for nonlinear equations
- On Convergence of a Random Search Method in Convex Minimization Problems
- On the rate of convergence of the minimization method along vectors in a given directional system
- Optimization of convex functions with random pursuit
- Optimized relative step size random searches
- Random gradient-free minimization of convex functions
- Scalable subspace methods for derivative-free nonlinear least-squares optimization
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Stochastic three points method for unconstrained smooth minimization
- Testing Unconstrained Optimization Software
- Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points
- Zeroth-order regularized optimization (ZORO): approximately sparse gradients and adaptive sampling
This page was built for publication: Curvature-aware derivative-free optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7002297)
