Line search methods with variable sample size for unconstrained optimization
From MaRDI portal
Publication:1947504
DOI10.1016/j.cam.2012.12.020zbMath1262.65066OpenAlexW2089630895MaRDI QIDQ1947504
Nataša Krejić, Nataša Krklec Jerinkić
Publication date: 22 April 2013
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2012.12.020
Related Items (12)
An adaptive stochastic sequential quadratic programming with differentiable exact augmented Lagrangians ⋮ Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming ⋮ Inexact restoration with subsampled trust-region methods for finite-sum minimization ⋮ On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors ⋮ Spectral projected gradient method for stochastic optimization ⋮ Variable sample size method for equality constrained optimization problems ⋮ Barzilai–Borwein method with variable sample size for stochastic linear complementarity problems ⋮ Inexact Restoration approach for minimization with inexact evaluation of the objective function ⋮ Penalty variable sample size method for solving optimization problems with equality constraints in a form of mathematical expectation ⋮ Nonmonotone line search methods with variable sample size ⋮ An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems ⋮ Newton-like Method with Diagonal Correction for Distributed Optimization
This page was built for publication: Line search methods with variable sample size for unconstrained optimization
