Pages that link to "Item:Q2084588"
From MaRDI portal
The following pages link to Linesearch Newton-CG methods for convex optimization with noise (Q2084588):
Displaying 5 items.
- A nonmonotone line search method for noisy minimization (Q499697) (← links)
- Continuation methods with the trusty time-stepping scheme for linearly constrained optimization with noisy data (Q2138306) (← links)
- A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization (Q2297654) (← links)
- LSOS: Line-search second-order stochastic optimization methods for nonconvex finite sums (Q5879118) (← links)
- A sequential quadratic programming method with high-probability complexity bounds for nonlinear equality-constrained stochastic optimization (Q6663117) (← links)