default search action
Sajad Fathi Hafshejani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Sajad Fathi Hafshejani
, Daya Ram Gaur
On Implementing a Two-Step Interior Point Method for Solving Linear Programs. Algorithms 17(7): 303 (2024) - [c3]Sajad Fathi Hafshejani, Daya Ram Gaur
An Efficient Interior Point Method for Linear Optimization Using Modified Newton Method. CALDAM 2024: 133-147 - 2023
- [j7]Sajad Fathi Hafshejani
Initialization for non-negative matrix factorization: a comprehensive review. Int. J. Data Sci. Anal. 16(1): 119-134 (2023) - [j6]Sajad Fathi Hafshejani, Zahra Moaberfard:
A new trigonometric kernel function for support vector machine. Iran J. Comput. Sci. 6(2): 137-145 (2023) - [c2]Vijay Adoni, Sajad Fathi Hafshejani, Daya Ram Gaur:
Empirical Evaluation of A Quantum Accelerated Approach for The Central Path Method in Linear Programming. VLDB Workshops 2023 - [i5]David Neufeld, Sajad Fathi Hafshejani, Daya Ram Gaur
A Hybrid Quantum Algorithm for Load Flow. CoRR abs/2310.19953 (2023) - 2022
- [c1]Sajad Fathi Hafshejani
Binary Orthogonal Non-negative Matrix Factorization. ICONIP (5) 2022: 28-38 - [i4]Sajad Fathi Hafshejani, Zahra Moaberfard:
A new trigonometric kernel function for SVM. CoRR abs/2210.08585 (2022) - [i3]Sajad Fathi Hafshejani, Daya Ram Gaur
Binary Orthogonal Non-negative Matrix Factorization. CoRR abs/2210.10660 (2022) - 2021
- [i2]Sajad Fathi Hafshejani, Zahra Moaberfard:
Initialization for Nonnegative Matrix Factorization: a Comprehensive Review. CoRR abs/2109.03874 (2021) - [i1]Sajad Fathi Hafshejani, Daya Ram Gaur
Barzilai and Borwein conjugate gradient method equipped with a non-monotone line search technique and its application on non-negative matrix factorization. CoRR abs/2109.05685 (2021) - 2020
- [j5]Sajad Fathi Hafshejani
An interior point method for $$P_{*}(\kappa )$$-horizontal linear complementarity problem based on a new proximity function. J. Appl. Math. Comput. 62(1-2): 281-300 (2020)
2010 – 2019
- 2018
- [j4]Sajad Fathi Hafshejani
Complexity of Interior Point Methods for a Class of Linear Complementarity Problems Using a Kernel Function with Trigonometric Growth Term. J. Optim. Theory Appl. 178(3): 935-949 (2018) - 2016
- [j3]M. Reza Peyghami
A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions. Oper. Res. Lett. 44(3): 319-323 (2016) - 2014
- [j2]M. Reza Peyghami
Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function. J. Comput. Appl. Math. 255: 74-85 (2014) - [j1]M. Reza Peyghami
Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function. Numer. Algorithms 67(1): 33-48 (2014)
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-09-10 01:15 CEST 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: