Researchers



Refined By:
Mp-cat.:  M21

Issue DateTitleAuthor(s)TypeМp-cat.
2024AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problemsKrklec Jerinkić, Nataša  ; Ostojić, Tijana  Article
21M21
2023An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problemsKrejić, Natasa  ; Krklec-Jerinkić, Natasa  ; Ostojić, Tijana  Article
21M21
2022EFIX: Exact fixed point methods for distributed optimizationJakovetić Dušan  ; Krejić Nataša  ; Krklec Jerinkić Nataša  Article
21M21
2022A Hessian Inversion-Free Exact Second Order Method for Distributed Consensus OptimizationJakovetić Dušan  ; Krejić Nataša  ; Jerinkic N.K.  Article
21M21
2022LSOS: Line-search second-order stochastic optimization methods for nonconvex finite sumsDaniela di Serafino; Krejić Nataša  ; Krklec Jerinkić Nataša  ; Marco ViolaArticle
21M21
2020Distributed Second-Order Methods With Increasing Number of Working NodesKrklec Jerinkić, Nataša  ; Jakovetić, Dušan  ; Krejić, Nataša  ; Bajović, Dragana  Article
21M21
2019Exact spectral-like gradient method for distributed optimizationJakovetić, Dušan  ; Krejić, Nataša  ; Krklec Jerinkić, Nataša  Article
21M21
2019Spectral projected gradient method for stochastic optimizationKrejić, Nataša  ; Krklec Jerinkić, Nataša  Article
21M21
2018Variable sample size method for equality constrained optimization problemsKrejić, Nataša  ; Krklec Jerinkić, Nataša  ; Rožnjik, Andrea  Article
21M21
2016Distributed Gradient Methods with Variable Number of Working NodesJakovetic, Dusan  ; Bajovic, Dragana  ; Krejic, Natasa  ; Krklec Jerinkić, Nataša  Article
21M21
2014Nonmonotone line search methods with variable sample sizeKrejić, Nataša  ; Krklec Jerinkić, Nataša  Article
21M21
2013Line search methods with variable sample size for unconstrained optimizationKrejić, Nataša  ; Krklec Jerinkić, Nataša  Article
21M21