Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Bilall I. Shaini"'
Autor:
Predrag S. Stanimirović, Bilall I. Shaini, Jamilu Sabi’u, Abdullah Shah, Milena J. Petrović, Branislav Ivanov, Xinwei Cao, Alena Stupina, Shuai Li
Publikováno v:
Algorithms, Vol 16, Iss 2, p 64 (2023)
This research proposes and investigates some improvements in gradient descent iterations that can be applied for solving system of nonlinear equations (SNE). In the available literature, such methods are termed improved gradient descent methods. We u
Externí odkaz:
https://doaj.org/article/acd97058c9f94823aa26149d776106ee
Publikováno v:
Journal of Function Spaces, Vol 2021 (2021)
A new rule for calculating the parameter t involved in each iteration of the MHSDL (Dai-Liao) conjugate gradient (CG) method is presented. The new value of the parameter initiates a more efficient and robust variant of the Dai-Liao algorithm. Under p
Externí odkaz:
https://doaj.org/article/e7fdd88c5f8449239c68c27b1b6de490
Publikováno v:
Journal of Function Spaces, Vol 2021 (2021)
A new rule for calculating the parameter t involved in each iteration of the MHSDL (Dai-Liao) conjugate gradient (CG) method is presented. The new value of the parameter initiates a more efficient and robust variant of the Dai-Liao algorithm. Under p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::502a764e31c4d2e2e9144072310eff24
https://doi.org/10.1155/2021/6693401
https://doi.org/10.1155/2021/6693401
Publikováno v:
Facta Universitatis, Series: Mathematics and Informatics. :1417
The gradient method is a very efficient iterative technique for solving unconstrained optimization problems. Motivated by recent modifications of some variants of the SM method, this study proposed two methods that are globally convergent as well as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd671a3efdc62e0203bfb9d5c5bf2e70
https://doi.org/10.22190/fumi2005417i
https://doi.org/10.22190/fumi2005417i
Autor:
Bilall I. Shaini
Publikováno v:
Filomat. 30:403-418
We derive conditions for the existence and investigate representations of {2, 4} and {2,3}-inverses with prescribed range T and null space S. A general computational algorithm for {2,4} and {2,3} generalized inverses with given rank and prescribed ra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f5541c7b175d076c97b39b1b1f1b83bd
https://doi.org/10.2298/fil1602403s
https://doi.org/10.2298/fil1602403s
Publikováno v:
2017 UBT International Conference.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4176114637e3cbefb46b6c64ec848d5e
https://doi.org/10.33107/ubt-ic.2017.98
https://doi.org/10.33107/ubt-ic.2017.98
Autor:
Bilall I. Shaini
Publikováno v:
Journal of Mathematics Research. 6
Several full-rank representations of the $A_{T,S}^{(2)}$ inverse of a given constant complex matrix, which are based on various complete orthogonal factorizations, are introduced. Particularly, we introduce a full rank representation based on the Sin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::798a9c5078c810da94690ac87893e36d
https://doi.org/10.5539/jmr.v6n3p91
https://doi.org/10.5539/jmr.v6n3p91