default search action
Ahmad Kamandi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Abdulkarim Hassan Ibrahim
, Sanja Rapajic
Relaxed-inertial derivative-free algorithm for systems of nonlinear pseudo-monotone equations. Comput. Appl. Math. 43(4): 239 (2024) - [j11]Mohammad Eslamian
Inertial methods for split common fixed point problems: application to binary classification in machine learning. Comput. Appl. Math. 43(6): 371 (2024) - [j10]Masoud Ezati, Mohsen Esmaeilbeigi, Ahmad Kamandi:
Novel approaches for hyper-parameter tuning of physics-informed Gaussian processes: application to parametric PDEs. Eng. Comput. 40(5): 3175-3194 (2024) - [j9]Mohammad Eslamian, Ahmad Kamandi:
A novel method for hierarchical variational inequality with split common fixed point constraint. J. Appl. Math. Comput. 70(3): 1837-1857 (2024) - [j8]Mohammad Eslamian, Ahmad Kamandi:
Hierarchical variational inequality problem and split common fixed point of averaged operators. J. Comput. Appl. Math. 437: 115490 (2024) - 2022
- [j7]Abdulkarim Hassan Ibrahim
An efficient hybrid conjugate gradient method for unconstrained optimization. Optim. Methods Softw. 37(4): 1370-1383 (2022)
2010 – 2019
- 2019
- [j6]Mohsen Ahmadvand, Mohsen Esmaeilbeigi
An improved hybrid-ORBIT algorithm based on point sorting and MLE technique. Comput. Appl. Math. 38(4) (2019) - [j5]Mohsen Ahmadvand, Mohsen Esmaeilbeigi
A novel hybrid trust region algorithm based on nonmonotone and LOOCV techniques. Comput. Optim. Appl. 72(2): 499-524 (2019) - 2018
- [j4]Oleg Burdakov, Ahmad Kamandi
Multipoint secant and interpolation methods with nonmonotone line search for solving systems of nonlinear equations. Appl. Math. Comput. 338: 421-431 (2018) - 2017
- [j3]Ahmad Kamandi
An improved adaptive trust-region algorithm. Optim. Lett. 11(3): 555-569 (2017) - 2015
- [j2]Keyvan Amini
A double-projection-based algorithm for large-scale nonlinear systems of monotone equations. Numer. Algorithms 68(2): 213-228 (2015) - [j1]Keyvan Amini
A new line search strategy for finding separating hyperplane in projection-based methods. Numer. Algorithms 70(3): 559-570 (2015)
Coauthor Index
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-31 20:15 CET 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: