Spectral projected gradient method for stochastic optimization
From MaRDI portal
Publication:670658
DOI10.1007/s10898-018-0682-6zbMath1417.90109OpenAlexW2811289997WikidataQ129594563 ScholiaQ129594563MaRDI QIDQ670658
Nataša Krklec Jerinkić, Nataša Krejić
Publication date: 18 March 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0682-6
spectral projected gradientsample average approximationvariable sample sizeconstrained stochastic problems
Related Items (3)
Subsampled nonmonotone spectral gradient methods ⋮ Spectral projected subgradient method for nonsmooth convex optimization problems ⋮ Penalty variable sample size method for solving optimization problems with equality constraints in a form of mathematical expectation
Uses Software
Cites Work
- A Stochastic Quasi-Newton Method for Large-Scale Optimization
- Optimality functions in stochastic programming
- Sample size selection in optimization methods for machine learning
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- An adaptive Monte Carlo algorithm for computing mixed logit estimators
- Efficient sample sizes in stochastic nonlinear programming
- Stochastic algorithms with Armijo stepsizes for minimization of functions
- Optimization algorithm with probabilistic estimation
- Convergence analysis of gradient descent stochastic algorithms
- Line search methods with variable sample size for unconstrained optimization
- A class on nonmonotone stabilization methods in unconstrained optimization
- Nonmonotone line search methods with variable sample size
- Convergence theory for nonconvex stochastic programming with an application to mixed logit
- Global Convergence of Online Limited Memory BFGS
- Inexact Restoration approach for minimization with inexact evaluation of the objective function
- Hybrid Deterministic-Stochastic Methods for Data Fitting
- On Choosing Parameters in Retrospective-Approximation Algorithms for Stochastic Root Finding and Simulation Optimization
- On the Use of Stochastic Hessian Information in Optimization Methods for Machine Learning
- A Sequential Sampling Procedure for Stochastic Programming
- Descent direction method with line search for unconstrained optimization in noisy environment
- Lectures on Stochastic Programming
- A Scaled Stochastic Approximation Algorithm
- A Modified Quasi‐Newton Method for Optimization in Simulation
- Introduction to Stochastic Search and Optimization
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Variable-sample methods for stochastic optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Benchmarking optimization software with performance profiles.
This page was built for publication: Spectral projected gradient method for stochastic optimization