A line search framework with restarting for noisy optimization problems
From MaRDI portal
Cites work
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A noise-tolerant quasi-Newton algorithm for unconstrained optimization
- A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression
- A stochastic line search method with expected complexity analysis
- A survey of nonlinear conjugate gradient methods
- A trust region method for noisy unconstrained optimization
- Algorithm 851
- Analysis of the BFGS Method with Errors
- ASTRO-DF: a class of adaptive sampling trust-region algorithms for derivative-free stochastic optimization
- Benchmarking Derivative-Free Optimization Algorithms
- Benchmarking optimization software with performance profiles.
- Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Derivative-free and blackbox optimization
- Derivative-free optimization methods
- Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
- First- and second-order high probability complexity bounds for trust-region methods with noisy oracles
- Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise
- Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
- High probability complexity bounds for adaptive step search based on stochastic oracles
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Introduction to Derivative-Free Optimization
- On sampling rates in simulation-based recursions
- On the Global Convergence of Trust Region Algorithms Using Inexact Gradient Information
- Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations
- Optimization for data analysis
- Optimization methods for large-scale machine learning
- Sample size selection in optimization methods for machine learning
- Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition
- Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
This page was built for publication: A line search framework with restarting for noisy optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6844273)
