default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNatasa Krejic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j44]Natasa Krejic
, Natasa Krklec Jerinkic, Angeles Martinez, Mahsa Yousefi:
A non-monotone trust-region method with noisy oracles and additional sampling. Comput. Optim. Appl. 89(1): 247-278 (2024)- [j43]Greta Malaspina, Dusan Jakovetic, Natasa Krejic:
Linear convergence rate analysis of a class of exact first-order distributed methods for weight-balanced time-varying networks and uncoordinated step sizes. Optim. Lett. 18(3): 825-846 (2024) - 2023
- [j42]Stefania Bellavia, Natasa Krejic, Benedetta Morini, Simone Rebegoldi:
A stochastic first-order trust-region method with inexact restoration for finite-sum minimization. Comput. Optim. Appl. 84(1): 53-84 (2023) - [j41]Giulia Ferrandi, Michiel E. Hochstenbach, Natasa Krejic:
A harmonic framework for stepsize selection in gradient methods. Comput. Optim. Appl. 85(1): 75-106 (2023) - [j40]Natasa Krejic, Greta Malaspina, Lense Swaenen:
A split Levenberg-Marquardt method for large-scale sparse problems. Comput. Optim. Appl. 85(1): 147-179 (2023) - [j39]Natasa Krejic, Natasa Krklec Jerinkic, Tijana Ostojic:
An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems. J. Comput. Appl. Math. 423: 114943 (2023) - [j38]Dusan Jakovetic, Natasa Krejic, Natasa Krklec Jerinkic:
EFIX: Exact fixed point methods for distributed optimization. J. Glob. Optim. 85(3): 637-661 (2023) - [j37]Matthias Rottmann, Kira Maag, Mathis Peyron, Hanno Gottschalk, Natasa Krejic:
Detection of Iterative Adversarial Attacks via Counter Attack. J. Optim. Theory Appl. 198(3): 892-929 (2023) - [j36]Natasa Krejic, Natasa Krklec Jerinkic, Tijana Ostojic:
Spectral projected subgradient method for nonsmooth convex optimization problems. Numer. Algorithms 93(1): 347-365 (2023) - [j35]Natasa Krejic, Evelin H. M. Krulikovski, Marcos Raydan:
A Low-Cost Alternating Projection Approach for a Continuous Formulation of Convex and Cardinality Constrained Optimization. Oper. Res. Forum 4(4): 73 (2023) - 2022
- [j34]Milos Savic, Jasna Atanasijevic, Dusan Jakovetic, Natasa Krejic:
Tax evasion risk management using a Hybrid Unsupervised Outlier Detection method. Expert Syst. Appl. 193: 116409 (2022) - [j33]Ernesto G. Birgin, Natasa Krejic, José Mario Martínez:
Inexact restoration for derivative-free expensive function minimization and applications. J. Comput. Appl. Math. 410: 114193 (2022) - [j32]Daniela di Serafino, Natasa Krejic, Natasa Krklec Jerinkic, Marco Viola:
LSOS: Line-search second-order stochastic optimization methods for nonconvex finite sums. Math. Comput. 92(341): 1273-1299 (2022) - [j31]Dusan Jakovetic, Natasa Krejic, Natasa Krklec Jerinkic:
A Hessian Inversion-Free Exact Second Order Method for Distributed Consensus Optimization. IEEE Trans. Signal Inf. Process. over Networks 8: 755-770 (2022) - [i13]Giulia Ferrandi, Michiel E. Hochstenbach, Natasa Krejic:
A harmonic framework for stepsize selectionin gradient methods. CoRR abs/2202.10213 (2022) - [i12]Natasa Krejic, Natasa Krklec Jerinkic, Tijana Ostojic:
Spectral Projected Subgradient Method for Nonsmooth Convex Optimization Problems. CoRR abs/2203.12681 (2022) - [i11]Dusan Jakovetic, Natasa Krejic, Natasa Krklec Jerinkic:
A Hessian inversion-free exact second order method for distributed consensus optimization. CoRR abs/2204.02690 (2022) - [i10]Natasa Krejic, Greta Malaspina, Lense Swaenen:
Splitted Levenberg-Marquardt Method for Large-Scale Sparse Problems. CoRR abs/2206.05188 (2022) - 2021
- [j30]Dusan Jakovetic, Natasa Krejic, Natasa Krklec Jerinkic, Greta Malaspina, Alessandra Micheletti:
Distributed fixed point method for solving systems of linear algebraic equations. Autom. 134: 109924 (2021) - [j29]Lidija Fodor, Dusan Jakovetic, Natasa Krejic, Natasa Krklec Jerinkic, Srdan Skrbic:
Performance evaluation and analysis of distributed multi-agent optimization algorithms with sparsified directed communication. EURASIP J. Adv. Signal Process. 2021(1): 25 (2021) - [i9]Milos Savic, Jasna Atanasijevic, Dusan Jakovetic, Natasa Krejic:
Tax Evasion Risk Management Using a Hybrid Unsupervised Outlier Detection Method. CoRR abs/2103.01033 (2021) - [i8]Natasa Krejic, Natasa Krklec Jerinkic, Tijana Ostojic:
Minimizing Nonsmooth Convex Functions with Variable Accuracy. CoRR abs/2103.13651 (2021) - [i7]Stefania Bellavia, Natasa Krejic, Benedetta Morini, Simone Rebegoldi:
A stochastic first-order trust-region method with inexact restoration for finite-sum minimization. CoRR abs/2107.03129 (2021) - 2020
- [j28]Stefania Bellavia, Natasa Krejic, Benedetta Morini:
Inexact restoration with subsampled trust-region methods for finite-sum minimization. Comput. Optim. Appl. 76(3): 701-736 (2020) - [j27]Ernesto G. Birgin, Natasa Krejic, José Mario Martínez:
Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact. Math. Comput. 89(321): 253-278 (2020) - [j26]Natasa Krklec Jerinkic, Dusan Jakovetic, Natasa Krejic, Dragana Bajovic:
Distributed Second-Order Methods With Increasing Number of Working Nodes. IEEE Trans. Autom. Control. 65(2): 846-853 (2020) - [i6]Dusan Jakovetic, Natasa Krejic, Natasa Krklec Jerinkic, Greta Malaspina, Alessandra Micheletti:
Distributed Fixed Point Method for Solving Systems of Linear Algebraic Equations. CoRR abs/2001.03968 (2020) - [i5]Daniela di Serafino, Natasa Krejic, Natasa Krklec Jerinkic, Marco Viola:
LSOS: Line-search Second-Order Stochastic optimization methods. CoRR abs/2007.15966 (2020) - [i4]Matthias Rottmann, Mathis Peyron, Natasa Krejic, Hanno Gottschalk:
Detection of Iterative Adversarial Attacks via Counter Attack. CoRR abs/2009.11397 (2020)
2010 – 2019
- 2019
- [j25]Dusan Jakovetic, Natasa Krejic, Natasa Krklec Jerinkic:
Exact spectral-like gradient method for distributed optimization. Comput. Optim. Appl. 74(3): 703-728 (2019) - [j24]Natasa Krejic, Natasa Krklec Jerinkic:
Spectral projected gradient method for stochastic optimization. J. Glob. Optim. 73(1): 59-81 (2019) - [c3]Aleksandar Armacki, Dusan Jakovetic, Natasa Krejic, Natasa Krklec Jerinkic:
Distributed Trust-Region Method With First Order Models. EUROCON 2019: 1-6 - [c2]Dusan Jakovetic, Natasa Krejic, Natasa Krklec Jerinkic:
Spectral-like gradient method for distributed optimization. EUROCON 2019: 1-5 - 2018
- [j23]Ernesto G. Birgin, Natasa Krejic, José Mario Martínez:
On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors. Math. Comput. 87(311): 1307-1326 (2018) - [j22]Natasa Krejic, Natasa Krklec Jerinkic, Andrea Roznjik:
Variable sample size method for equality constrained optimization problems. Optim. Lett. 12(3): 485-497 (2018) - 2017
- [j21]Ernesto G. Birgin, Natasa Krejic, José Mario Martínez:
On the minimization of possibly discontinuous functions by means of pointwise approximations. Optim. Lett. 11(8): 1623-1637 (2017) - [j20]Dragana Bajovic, Dusan Jakovetic, Natasa Krejic, Natasa Krklec Jerinkic:
Newton-like Method with Diagonal Correction for Distributed Optimization. SIAM J. Optim. 27(2): 1171-1203 (2017) - [i3]Dragana Bajovic, Dusan Jakovetic, Natasa Krejic, Natasa Krklec Jerinkic:
Distributed second order methods with variable number of working nodes. CoRR abs/1709.01307 (2017) - 2016
- [j19]Natasa Krejic, José Mario Martínez:
Inexact Restoration approach for minimization with inexact evaluation of the objective function. Math. Comput. 85(300): 1775-1791 (2016) - [j18]Dusan Jakovetic, Dragana Bajovic, Natasa Krejic, Natasa Krklec Jerinkic:
Distributed Gradient Methods with Variable Number of Working Nodes. IEEE Trans. Signal Process. 64(15): 4080-4095 (2016) - [c1]Dusan Jakovetic, Natasa Krklec Jerinkic, Natasa Krejic, Dragana Bajovic:
Distributed first and second order methods with increasing number of working nodes. GlobalSIP 2016: 480-484 - 2015
- [j17]Miles Kumaresan, Natasa Krejic:
Optimal trading of algorithmic orders in a liquidity fragmented market place. Ann. Oper. Res. 229(1): 521-540 (2015) - [j16]Natasa Krejic, Natasa Krklec Jerinkic:
Nonmonotone line search methods with variable sample size. Numer. Algorithms 68(4): 711-739 (2015) - [j15]Natasa Krejic, Zorana Luzanin, Filip Nikolovski, Irena Stojkovska:
A nonmonotone line search method for noisy minimization. Optim. Lett. 9(7): 1371-1391 (2015) - [j14]Natasa Krejic, Zorana Luzanin, Zoran Ovcin, Irena Stojkovska:
Descent direction method with line search for unconstrained optimization in noisy environment. Optim. Methods Softw. 30(6): 1164-1184 (2015) - [i2]Dusan Jakovetic, Dragana Bajovic, Natasa Krejic, Natasa Krklec Jerinkic:
Distributed Gradient Methods with Variable Number of Working Nodes. CoRR abs/1504.04049 (2015) - [i1]Dragana Bajovic, Dusan Jakovetic, Natasa Krejic, Natasa Krklec Jerinkic:
Newton-like method with diagonal correction for distributed optimization. CoRR abs/1509.01703 (2015) - 2013
- [j13]Natasa Krejic, Natasa Krklec:
Line search methods with variable sample size for unconstrained optimization. J. Comput. Appl. Math. 245: 213-231 (2013) - 2011
- [j12]Natasa Krejic, Miles Kumaresan, Andrea Roznjik:
VaR optimal portfolio with transaction costs. Appl. Math. Comput. 218(8): 4626-4637 (2011) - [j11]Ernesto G. Birgin, Luis Felipe Bueno, Natasa Krejic, José Mario Martínez:
Low order-value approach for solving VaR-constrained optimization problems. J. Glob. Optim. 51(4): 715-742 (2011) - 2010
- [j10]Miles Kumaresan, Natasa Krejic:
A model for optimal execution of atomic orders. Comput. Optim. Appl. 46(2): 369-389 (2010) - [j9]Sandra Buhmiler, Natasa Krejic, Zorana Luzanin:
Practical Quasi-Newton algorithms for singular nonlinear systems. Numer. Algorithms 55(4): 481-502 (2010)
2000 – 2009
- 2009
- [j8]Natasa Krejic, Zorana Luzanin, Irena Stojkovska:
Gauss-Newton-based BFGS method with filter for unconstrained minimization. Appl. Math. Comput. 211(2): 354-362 (2009) - 2008
- [j7]Natasa Krejic, Sanja Rapajic:
Globally convergent Jacobian smoothing inexact Newton methods for NCP. Comput. Optim. Appl. 41(2): 243-261 (2008) - 2007
- [j6]Natasa Krejic, Zorana Luzanin, Ivana Radeka:
Newton-like method for nonlinear banded block diagonal system. Appl. Math. Comput. 189(2): 1705-1711 (2007) - 2006
- [j5]Natasa Krejic, Zorana Luzanin, Sanja Rapajic:
Iterative method with modification of the right-hand side vector for nonlinear complementarity problems. Int. J. Comput. Math. 83(2): 193-201 (2006) - 2003
- [j4]Ernesto G. Birgin, Natasa Krejic, José Mario Martínez:
Solution of Bounded Nonlinear Systems of Equations Using Homotopies with Inexact Restoration. Int. J. Comput. Math. 80(2): 211-222 (2003) - [j3]Ernesto G. Birgin, Natasa Krejic, José Mario Martínez:
Globally Convergent Inexact Quasi-Newton Methods for Solving Nonlinear Systems. Numer. Algorithms 32(2-4): 249-260 (2003) - 2002
- [j2]Natasa Krejic, Zorana Luzanin:
Newton-like method with modification of the right-hand-side vector. Math. Comput. 71(237): 237-250 (2002) - 2000
- [j1]Natasa Krejic, José Mario Martínez, Margarida Mello, Elvio A. Pilotta:
Validation of an Augmented Lagrangian Algorithm with a Gauss-Newton Hessian Approximation Using a Set of Hard-Spheres Problems. Comput. Optim. Appl. 16(3): 247-263 (2000)
Coauthor Index
aka: Natasa Krklec
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
