Pages that link to "Item:Q2340358"
From MaRDI portal
The following pages link to Nonmonotone line search methods with variable sample size (Q2340358):
Displaying 13 items.
- A nonmonotone line search method for noisy minimization (Q499697) (← links)
- Spectral projected gradient method for stochastic optimization (Q670658) (← links)
- A Levenberg-Marquardt method for large nonlinear least-squares problems with dynamic accuracy in functions and gradients (Q1616028) (← links)
- Variable sample size method for equality constrained optimization problems (Q1749777) (← links)
- Tensor Bernstein concentration inequalities with an application to sample estimators for high-order moments (Q2178629) (← links)
- Subsampled nonmonotone spectral gradient methods (Q2178981) (← links)
- Inexact restoration with subsampled trust-region methods for finite-sum minimization (Q2191786) (← links)
- Penalty variable sample size method for solving optimization problems with equality constraints in a form of mathematical expectation (Q2290926) (← links)
- Barzilai–Borwein method with variable sample size for stochastic linear complementarity problems (Q2790891) (← links)
- Inexact Restoration approach for minimization with inexact evaluation of the objective function (Q2796018) (← links)
- On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors (Q4605701) (← links)
- A nonmonotone line search method for stochastic optimization problems (Q5086883) (← links)
- Newton-like Method with Diagonal Correction for Distributed Optimization (Q5275293) (← links)
