Pages that link to "Item:Q1947504"
From MaRDI portal
The following pages link to Line search methods with variable sample size for unconstrained optimization (Q1947504):
Displaying 15 items.
- Spectral projected gradient method for stochastic optimization (Q670658) (← links)
- Variable-number sample-path optimization (Q959964) (← links)
- Variable sample size method for equality constrained optimization problems (Q1749777) (← links)
- Adaptive sampling line search for local stochastic optimization with integer variables (Q2097662) (← links)
- An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems (Q2112678) (← 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)
- Nonmonotone line search methods with variable sample size (Q2340358) (← 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)
- Newton-like Method with Diagonal Correction for Distributed Optimization (Q5275293) (← 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)
- Subsampled first-order optimization methods with applications in imaging (Q6606441) (← links)
