Adaptive regularized quasi-Newton method using inexact first-order information
From MaRDI portal
Cites work
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A regularized Newton method for computing ground states of Bose-Einstein condensates
- A review on subspace methods for nonlinear optimization
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Adaptive quadratically regularized Newton method for Riemannian optimization
- Adaptive regularized self-consistent field iteration with exact Hessian for electronic structure calculation
- Adaptive sampling strategies for stochastic optimization
- An unconstrained optimization test functions collection
- Analysis of the BFGS Method with Errors
- Benchmarking Derivative-Free Optimization Algorithms
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
- Composite convex optimization with global and local inexact oracles
- Computing Forward-Difference Intervals for Numerical Optimization
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Derivative-free optimization methods
- Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
- Estimating Computational Noise
- Estimating derivatives of noisy simulations
- First-order methods of smooth convex optimization with inexact oracle
- Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise
- scientific article; zbMATH DE number 1215244 (Why is no real title available?)
- scientific article; zbMATH DE number 3313108 (Why is no real title available?)
- Implicit filtering
- Inexact first-order primal-dual algorithms
- Introduction to Derivative-Free Optimization
- Numerical Experience with a Class of Algorithms for Nonlinear Optimization Using Inexact Function and Gradient Information
- On the Global Convergence of Trust Region Algorithms Using Inexact Gradient Information
- Random gradient-free minimization of convex functions
- Smooth Optimization with Approximate Gradient
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
- Stochastic optimization using a trust-region method and random models
- Truncated Newton methods for optimization with inaccurate functions and gradients
- Trust-region algorithms: probabilistic complexity and intrinsic noise with applications to subsampling techniques
This page was built for publication: Adaptive regularized quasi-Newton method using inexact first-order information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7019809)
