Natasa Krejic
Orcid: 0000-0003-3348-7233
According to our database1,
Natasa Krejic
authored at least 53 papers
between 2000 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Comput. Optim. Appl., September, 2024
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., April, 2024
2023
A Low-Cost Alternating Projection Approach for a Continuous Formulation of Convex and Cardinality Constrained Optimization.
Oper. Res. Forum, December, 2023
J. Optim. Theory Appl., September, 2023
Numer. Algorithms, May, 2023
Comput. Optim. Appl., May, 2023
Comput. Optim. Appl., May, 2023
J. Glob. Optim., March, 2023
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., 2023
A stochastic first-order trust-region method with inexact restoration for finite-sum minimization.
Comput. Optim. Appl., 2023
2022
LSOS: Line-search second-order stochastic optimization methods for nonconvex finite sums.
Math. Comput., November, 2022
A Hessian Inversion-Free Exact Second Order Method for Distributed Consensus Optimization.
IEEE Trans. Signal Inf. Process. over Networks, 2022
Inexact restoration for derivative-free expensive function minimization and applications.
J. Comput. Appl. Math., 2022
Expert Syst. Appl., 2022
2021
Performance evaluation and analysis of distributed multi-agent optimization algorithms with sparsified directed communication.
EURASIP J. Adv. Signal Process., 2021
Autom., 2021
2020
IEEE Trans. Autom. Control., 2020
Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact.
Math. Comput., 2020
Inexact restoration with subsampled trust-region methods for finite-sum minimization.
Comput. Optim. Appl., 2020
2019
J. Glob. Optim., 2019
Comput. Optim. Appl., 2019
Proceedings of the IEEE EUROCON 2019, 2019
Proceedings of the IEEE EUROCON 2019, 2019
2018
Optim. Lett., 2018
On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors.
Math. Comput., 2018
2017
SIAM J. Optim., 2017
On the minimization of possibly discontinuous functions by means of pointwise approximations.
Optim. Lett., 2017
2016
IEEE Trans. Signal Process., 2016
Inexact Restoration approach for minimization with inexact evaluation of the objective function.
Math. Comput., 2016
Proceedings of the 2016 IEEE Global Conference on Signal and Information Processing, 2016
2015
Descent direction method with line search for unconstrained optimization in noisy environment.
Optim. Methods Softw., 2015
Ann. Oper. Res., 2015
2013
J. Comput. Appl. Math., 2013
2011
J. Glob. Optim., 2011
2010
Numer. Algorithms, 2010
2009
Appl. Math. Comput., 2009
2008
Comput. Optim. Appl., 2008
2007
Appl. Math. Comput., 2007
2006
Iterative method with modification of the right-hand side vector for nonlinear complementarity problems.
Int. J. Comput. Math., 2006
2003
Numer. Algorithms, 2003
Solution of Bounded Nonlinear Systems of Equations Using Homotopies with Inexact Restoration.
Int. J. Comput. Math., 2003
2002
Math. Comput., 2002
2000
Validation of an Augmented Lagrangian Algorithm with a Gauss-Newton Hessian Approximation Using a Set of Hard-Spheres Problems.
Comput. Optim. Appl., 2000