Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/29500
Title: | Stochastic gradient methods for unconstrained optimization | Authors: | Krejić Nataša Krklec Jerinkić Nataša |
Issue Date: | 2014 | Journal: | Pesquisa Operacional | Abstract: | © 2014 Brazilian Operations Research Society. This papers presents an overview of gradient basedmethods for minimization of noisy functions. It is assumed that the objective functions is either given with error terms of stochastic nature or given as the mathematical expectation. Such problems arise in the context of simulation based optimization. The focus of this presentation is on the gradient based Stochastic Approximation and Sample Average Approximation methods. The concept of stochastic gradient approximation of the true gradient can be successfully extended to deterministic problems. Methods of this kind are presented for the data fitting and machine learning problems. | URI: | https://open.uns.ac.rs/handle/123456789/29500 | ISSN: | 0101-7438 | DOI: | 10.1590/0101-7438.2014.034.03.0373 |
Appears in Collections: | PMF Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
3
checked on Nov 20, 2023
Page view(s)
21
Last Week
8
8
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.