Pages that link to "Item:Q4555983"
From MaRDI portal
The following pages link to Complexity and global rates of trust-region methods based on probabilistic models (Q4555983):
Displaying 23 items.
- Concise complexity analyses for trust region methods (Q1634776) (← links)
- Newton-type methods for non-convex optimization under inexact Hessian information (Q2205970) (← links)
- Convergence of Trust-Region Methods Based on Probabilistic Models (Q2934477) (← links)
- A fully stochastic second-order trust region method (Q5043844) (← links)
- A Stochastic Levenberg--Marquardt Method Using Random Models with Complexity Results (Q5075237) (← links)
- Stochastic Trust-Region Methods with Trust-Region Radius Depending on Probabilistic Models (Q5079553) (← links)
- Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions (Q5081786) (← links)
- Coupled Learning Enabled Stochastic Programming with Endogenous Uncertainty (Q5085157) (← links)
- Convergence of Newton-MR under Inexact Hessian Information (Q5148404) (← links)
- Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions (Q5203798) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- Scalable subspace methods for derivative-free nonlinear least-squares optimization (Q6038650) (← links)
- An adaptive stochastic sequential quadratic programming with differentiable exact augmented Lagrangians (Q6038658) (← links)
- Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming (Q6052061) (← links)
- Direct Search Based on Probabilistic Descent in Reduced Spaces (Q6071887) (← links)
- Globally Convergent Multilevel Training of Deep Residual Networks (Q6108152) (← links)
- High probability complexity bounds for adaptive step search based on stochastic oracles (Q6573017) (← links)
- First- and second-order high probability complexity bounds for trust-region methods with noisy oracles (Q6608030) (← links)
- On the global complexity of a derivative-free Levenberg-Marquardt algorithm via orthogonal spherical smoothing (Q6608067) (← links)
- Derivative-free bound-constrained optimization for solving structured problems with surrogate models (Q6641007) (← links)
- Effective matrix adaptation strategy for noisy derivative-free optimization (Q6645950) (← 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)
