Natasa Krejic

Orcid: 0000-0003-3348-7233

According to our database1, Natasa Krejic authored at least 50 papers between 2000 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Detection of Iterative Adversarial Attacks via Counter Attack.
J. Optim. Theory Appl., September, 2023

Spectral projected subgradient method for nonsmooth convex optimization problems.
Numer. Algorithms, May, 2023

A split Levenberg-Marquardt method for large-scale sparse problems.
Comput. Optim. Appl., May, 2023

A harmonic framework for stepsize selection in gradient methods.
Comput. Optim. Appl., May, 2023

EFIX: Exact fixed point methods for distributed optimization.
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

Tax evasion risk management using a Hybrid Unsupervised Outlier Detection method.
Expert Syst. Appl., 2022

Splitted Levenberg-Marquardt Method for Large-Scale Sparse Problems.
CoRR, 2022

A harmonic framework for stepsize selectionin gradient methods.
CoRR, 2022

2021
Performance evaluation and analysis of distributed multi-agent optimization algorithms with sparsified directed communication.
EURASIP J. Adv. Signal Process., 2021

Minimizing Nonsmooth Convex Functions with Variable Accuracy.
CoRR, 2021

Distributed fixed point method for solving systems of linear algebraic equations.
Autom., 2021

2020
Distributed Second-Order Methods With Increasing Number of Working Nodes.
IEEE Trans. Autom. Control., 2020

Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact.
Math. Comput., 2020

Detection of Iterative Adversarial Attacks via Counter Attack.
CoRR, 2020

LSOS: Line-search Second-Order Stochastic optimization methods.
CoRR, 2020

Inexact restoration with subsampled trust-region methods for finite-sum minimization.
Comput. Optim. Appl., 2020

2019
Spectral projected gradient method for stochastic optimization.
J. Glob. Optim., 2019

Exact spectral-like gradient method for distributed optimization.
Comput. Optim. Appl., 2019

Spectral-like gradient method for distributed optimization.
Proceedings of the IEEE EUROCON 2019, 2019

Distributed Trust-Region Method With First Order Models.
Proceedings of the IEEE EUROCON 2019, 2019

2018
Variable sample size method for equality constrained optimization problems.
Optim. Lett., 2018

On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors.
Math. Comput., 2018

2017
Newton-like Method with Diagonal Correction for Distributed Optimization.
SIAM J. Optim., 2017

On the minimization of possibly discontinuous functions by means of pointwise approximations.
Optim. Lett., 2017

Distributed second order methods with variable number of working nodes.
CoRR, 2017

2016
Distributed Gradient Methods with Variable Number of Working Nodes.
IEEE Trans. Signal Process., 2016

Inexact Restoration approach for minimization with inexact evaluation of the objective function.
Math. Comput., 2016

Distributed first and second order methods with increasing number of working nodes.
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

A nonmonotone line search method for noisy minimization.
Optim. Lett., 2015

Nonmonotone line search methods with variable sample size.
Numer. Algorithms, 2015

Optimal trading of algorithmic orders in a liquidity fragmented market place.
Ann. Oper. Res., 2015

2013
Line search methods with variable sample size for unconstrained optimization.
J. Comput. Appl. Math., 2013

2011
Low order-value approach for solving VaR-constrained optimization problems.
J. Glob. Optim., 2011

VaR optimal portfolio with transaction costs.
Appl. Math. Comput., 2011

2010
Practical Quasi-Newton algorithms for singular nonlinear systems.
Numer. Algorithms, 2010

A model for optimal execution of atomic orders.
Comput. Optim. Appl., 2010

2009
Gauss-Newton-based BFGS method with filter for unconstrained minimization.
Appl. Math. Comput., 2009

2008
Globally convergent Jacobian smoothing inexact Newton methods for NCP.
Comput. Optim. Appl., 2008

2007
Newton-like method for nonlinear banded block diagonal system.
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
Globally Convergent Inexact Quasi-Newton Methods for Solving Nonlinear Systems.
Numer. Algorithms, 2003

Solution of Bounded Nonlinear Systems of Equations Using Homotopies with Inexact Restoration.
Int. J. Comput. Math., 2003

2002
Newton-like method with modification of the right-hand-side vector.
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


  Loading...