Predrag S. Stanimirović

ORCID: 0000-0003-0655-3741
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Matrix Theory and Algorithms
  • Advanced Optimization Algorithms Research
  • Neural Networks and Applications
  • Iterative Methods for Nonlinear Equations
  • Robotic Mechanisms and Dynamics
  • Electromagnetic Scattering and Analysis
  • Control Systems and Identification
  • Model Reduction and Neural Networks
  • Metaheuristic Optimization Algorithms Research
  • Sparse and Compressive Sensing Techniques
  • Advanced Computational Techniques and Applications
  • Tensor decomposition and applications
  • Advanced Topics in Algebra
  • Numerical methods in inverse problems
  • Algebraic and Geometric Analysis
  • Statistical and numerical algorithms
  • Scientific Research and Discoveries
  • Advanced Mathematical Theories and Applications
  • Numerical Methods and Algorithms
  • Optimization and Variational Analysis
  • Advanced Numerical Analysis Techniques
  • Optimization and Mathematical Programming
  • Mathematics and Applications
  • Vehicle Routing Optimization Methods
  • Facility Location and Emergency Management

University of Nis
2016-2025

Siberian Federal University
2022-2024

Univerzitet u Novom Pazaru
2022

University of Belgrade
2012-2021

State University of Tetova
2021

Huzhou University
2020

Laboratoire d'Informatique de Paris-Nord
2018

Mining and Metallurgy Institute Bor
2012

Korean Mathematical Society
2011

This work aims to propose a new analyzing tool, called the fractional iteration algorithm I for finding numerical solutions of nonlinear time fractional-order Cauchy reaction-diffusion model equations. The key property suggested technique is its ability and flexibility investigate linear models conveniently accurately. proposed approach can be utilized without use any transformation, Adomian polynomials, small perturbation, discretization or linearization. main feature algorithm-I...

10.1016/j.rinp.2020.103462 article EN cc-by-nc-nd Results in Physics 2020-10-08

The role of integer and noninteger order partial differential equations (PDE) is essential in applied sciences engineering. Exact solutions these are sometimes difficult to find. Therefore, it takes time develop some numerical techniques find accurate types equations. This work aims present a novel approach termed as fractional iteration algorithm-I for finding the solution nonlinear proposed developed tested on fractional-order Fornberg–Whitham equation employed without using any...

10.1155/2020/8829017 article EN cc-by Complexity 2020-10-06

Variational iteration method has been extensively employed to deal with linear and nonlinear differential equations of integer fractional order. The key property the technique is its ability flexibility investigate models conveniently accurately. current study presents an improved algorithm variational algorithm-II (VIA-II) for numerical treatment diffusion as well convection-diffusion equations. This newly introduced modification termed modified (MVIA-II). convergence MVIA-II studied in...

10.1155/2020/8841718 article EN cc-by Complexity 2020-10-06

The problem of solving linear equations is considered as one the fundamental problems commonly encountered in science and engineering. In this article, complex-valued time-varying matrix equation (CVTV-LME) investigated. Then, by employing a complex-valued, QR (CVTVQR) decomposition, zeroing neural network (ZNN) method, equivalent transformations, Kronecker product, vectorization techniques, we propose study CVTVQR decomposition-based (CVTVQR-LME) model. addition to usage further advantage...

10.1109/tnnls.2021.3052896 article EN IEEE Transactions on Neural Networks and Learning Systems 2021-01-29

This paper presents a recurrent neural network (RNN) for computing the Drazin inverse of real matrix in time. is composed n independent parts (subnetworks), where order input matrix. These subnetworks can operate concurrently, so parallel and distributed processing be achieved. In this way, computational advantages over existing sequential algorithms attained real-time applications. The RNN defined convenient an implementation electronic circuit. number neurons same as elements output...

10.1109/tnnls.2015.2397551 article EN IEEE Transactions on Neural Networks and Learning Systems 2015-02-18

The Zhang neural network (ZNN) has recently realized remarkable success in solving time-varying problems. Harmonic noise widely exists industrial applications and can severely affect the solution computed by ZNN models. This article attempts to solve aforementioned limitations providing first design with an inherent capability prohibit harmonic noise. Moreover, it opens new opportunities shift research on ZNNs ideal situations that theoretical consideration nonideal working environments. We...

10.1109/tii.2019.2944517 article EN IEEE Transactions on Industrial Informatics 2019-10-02

The problem of portfolio management relates to the selection optimal stocks, which results in a maximum return investor while minimizing loss. Traditional approaches usually model as convex optimization and require calculation gradient. Note that gradient-based methods can stuck at local optimum for complex problems simplification convex, further solved using methods, is high cost solution accuracy. In this paper, we formulate nonconvex problem, considers transaction cardinality constraint,...

10.1109/access.2020.2982195 article EN cc-by IEEE Access 2020-01-01

A correlation between fuzzy logic systems (FLS) and zeroing neural networks (ZNN) design is investigated. It shown that the gain parameter included in ZNN can be dynamically adjusted over time by means of an appropriate value derived as output a properly defined FLS, which includes appropriately membership functions rules. Dynamical are applicable to time-varying rank-deficient matrices proposed. Convergence properties investigated illustrative simulation experiments performed. Presented...

10.1109/tfuzz.2021.3115969 article EN IEEE Transactions on Fuzzy Systems 2021-09-28

Neutrosophic sets have been recognized as an effective approach in solving complex decision-making (DM) problems, mainly when such problems are related to uncertainties, published numerous articles thus far. The use of the three membership functions that can be used express accuracy, inaccuracy, and indeterminacy during evaluation alternatives multiple-criteria DM said a significant advantage these sets. By utilizing functions, neutrosophic provide efficient flexible alternatives, even if...

10.3390/sym12081263 article EN Symmetry 2020-07-30

In this article, a simple and new algorithm is proposed, namely the modified variational iteration algorithm-I (mVIA-I), for obtaining numerical solutions to different types of fifth-order Korteweg de-Vries (KdV) equations. order verify precision, accuracy stability mVIA-I method, generated results are compared with Laplace decomposition Adomian Homotopy perturbation transform method method. Comparison mentioned methods reveals that computationally attractive, exceptionally productive...

10.22055/jacm.2020.33305.2197 article EN Applied and Computational Mechanics 2020-12-01

A special recurrent neural network (RNN), that is the zeroing (ZNN), adopted to find solutions time-varying quadratic programming (TVQP) problems with equality and inequality constraints. However, there are some weaknesses in activation functions of traditional ZNN models, including convex restriction redundant formulation. With aid different functions, modified models obtained overcome drawbacks for solving TVQP problems. Theoretical experimental research indicate proposed better more...

10.1049/cit2.12019 article EN cc-by CAAI Transactions on Intelligence Technology 2021-03-15

Engineering design optimization problems are difficult to solve because the objective function is often complex, with a mix of continuous and discrete variables various constraints. Our research presents novel hybrid algorithm that integrates benefits sine cosine (SCA) artificial bee colony (ABC) address engineering problems. The SCA recently developed metaheuristic many advantages, such as good search ability reasonable execution time, but it may suffer from premature convergence. enhanced...

10.3390/math10234555 article EN cc-by Mathematics 2022-12-01

The Markowitz model, a Nobel Prize winning model for portfolio analysis, paves the theoretical foundation in finance modern investment. However, it remains challenging problem high frequency trading (HFT) era to find more time efficient solution especially when considering circumstances with dynamic fluctuation of stock prices and desire pursue contradictory objectives less risk but return. In this paper, we establish recurrent neural network address runtime. Rigorous analysis on convergence...

10.1016/j.eswa.2023.120934 article EN cc-by Expert Systems with Applications 2023-07-08

High-frequency trading proposes new challenges to classical portfolio selection problems. Especially, the timely and accurate solution of portfolios is highly demanded in financial market nowadays. This article makes progress along this direction by proposing novel neural networks with softmax equalization address problem. To best our knowledge, first time that technique used deal equation constraints selections. Theoretical analysis shows proposed method globally convergent optimum...

10.1109/tnnls.2023.3311169 article EN IEEE Transactions on Neural Networks and Learning Systems 2023-09-13
Coming Soon ...