Pages that link to "Item:Q4997171"

The following pages link to Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise (Q4997171):

Displaying 22 items.

• Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives (Q2052165) (← links)
• Expected complexity analysis of stochastic direct-search (Q2070336) (← links)
• Linesearch Newton-CG methods for convex optimization with noise (Q2084588) (← links)
• A stochastic first-order trust-region method with inexact restoration for finite-sum minimization (Q2111466) (← links)
• Zeroth-order methods for noisy Hölder-gradient functions (Q2162695) (← links)
• The impact of noise on evaluation complexity: the deterministic trust-region case (Q2696963) (← links)
• A Noise-Tolerant Quasi-Newton Algorithm for Unconstrained Optimization (Q5026838) (← links)
• Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Sampling (Q5072595) (← links)
• Stochastic Trust-Region Methods with Trust-Region Radius Depending on Probabilistic Models (Q5079553) (← links)
• LSOS: Line-search second-order stochastic optimization methods for nonconvex finite sums (Q5879118) (← links)
• Full-low evaluation methods for derivative-free optimization (Q5882241) (← links)
• Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming (Q6052061) (← links)
• A trust region method for noisy unconstrained optimization (Q6052069) (← links)
• Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an \(\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}\) Complexity Bound (Q6116246) (← links)
• A line search based proximal stochastic gradient algorithm with dynamical variance reduction (Q6159404) (← links)
• Trust-region algorithms: probabilistic complexity and intrinsic noise with applications to subsampling techniques (Q6170037) (← links)
• High probability complexity bounds for adaptive step search based on stochastic oracles (Q6573017) (← links)
• Small errors in random zeroth-order optimization are imaginary (Q6580001) (← links)
• Stochastic trust-region algorithm in random subspaces with convergence and expected complexity analyses (Q6580002) (← links)
• First- and second-order high probability complexity bounds for trust-region methods with noisy oracles (Q6608030) (← links)
• A sequential quadratic programming method with high-probability complexity bounds for nonlinear equality-constrained stochastic optimization (Q6663117) (← links)
• Sample complexity analysis for adaptive optimization algorithms with stochastic oracles (Q6665393) (← links)