Pages that link to "Item:Q2848195"
From MaRDI portal
The following pages link to Optimization of Convex Functions with Random Pursuit (Q2848195):
Displaying 15 items.
- Variable metric random pursuit (Q263217) (← links)
- Almost sure hypothesis testing and a resolution of the Jeffreys-Lindley paradox (Q302434) (← links)
- Methods to compare expensive stochastic optimization algorithms with random restarts (Q1756805) (← links)
- A stochastic subspace approach to gradient-free optimization in high dimensions (Q2044475) (← links)
- Linear Convergence of Comparison-based Step-size Adaptive Randomized Search via Stability of Markov Chains (Q3187981) (← links)
- Randomized Iterative Methods for Linear Systems (Q3456879) (← links)
- Stochastic Three Points Method for Unconstrained Smooth Minimization (Q4971022) (← links)
- Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Sampling (Q5072595) (← links)
- An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization (Q5081777) (← links)
- Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions (Q5081786) (← links)
- Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory (Q5112239) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- Linearly convergent adjoint free solution of least squares problems by random descent (Q6141569) (← links)
- Global optimization using random embeddings (Q6160282) (← links)
- Small errors in random zeroth-order optimization are imaginary (Q6580001) (← links)
