default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBehrouz Kheirfam
Person information
- affiliation: Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j43]Hadis Abedi, Behrouz Kheirfam:
An efficient second-order predictor-corrector infeasible primal-dual IPM algorithm with large iteration path updates for solving well-known SDO problems. J. Comput. Appl. Math. 459: 116379 (2025)- 2024
- [j42]Behrouz Kheirfam
:
Complexity Analysis of a Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems. J. Optim. Theory Appl. 202(1): 133-145 (2024) - 2023
- [j41]Safa Guerdouh, Wided Chikouche, Behrouz Kheirfam:
A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term. J. Appl. Math. Comput. 69(4): 2935-2953 (2023) - [j40]Behrouz Kheirfam:
Corrector-Predictor Interior-Point Method With New Search Direction for Semidefinite Optimization. J. Sci. Comput. 95(1): 10 (2023) - 2022
- [j39]Behrouz Kheirfam, Naser Osmanpour:
A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization. J. Appl. Math. Comput. 68(2): 1365-1385 (2022) - 2021
- [j38]Behrouz Kheirfam, Mohaddeseh Mohamadi-Sangachin:
An predictor-corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood. Int. J. Comput. Math. 98(2): 414-433 (2021) - [j37]Behrouz Kheirfam, Afsaneh Nasrollahi, M. Mohammadi:
A Second-Order Corrector Infeasible Interior-Point Method for Semidefinite Optimization Based on a Wide Neighborhood. J. Sci. Comput. 86(1): 13 (2021) - [j36]Behrouz Kheirfam:
A Polynomial-Iteration Infeasible Interior-Point Algorithm with Arc-Search for Semidefinite optimization. J. Sci. Comput. 88(3): 89 (2021) - [j35]Behrouz Kheirfam, Naser Osmanpour, Mohammad Keyanpour:
An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood. Numer. Algorithms 88(1): 143-163 (2021) - [i1]Behrouz Kheirfam:
A new search direction for full-Newton step infeasible interior-point method in linear optimization. CoRR abs/2102.07223 (2021) - 2020
- [j34]Zsolt Darvay, Tibor Illés, Behrouz Kheirfam, Petra Renáta Rigó:
A corrector-predictor interior-point method with new search direction for linear optimization. Central Eur. J. Oper. Res. 28(3): 1123-1140 (2020) - [j33]Behrouz Kheirfam:
A Second-order Corrector Infeasible Interior-point Method with One-norm wide Neighborhood for Symmetric Optimization. Fundam. Informaticae 172(4): 343-359 (2020) - [j32]Behrouz Kheirfam:
A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood. Fundam. Informaticae 177(2): 141-156 (2020) - [j31]Behrouz Kheirfam, Masoumeh Haghighi:
A wide neighborhood interior-point algorithm based on the trigonometric kernel function. J. Appl. Math. Comput. 64(1-2): 119-135 (2020) - [j30]Behrouz Kheirfam, Masoumeh Haghighi:
A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps. Numer. Algorithms 85(1): 59-75 (2020) - [j29]Zsolt Darvay, Behrouz Kheirfam, Petra Renáta Rigó:
A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization. Optim. Lett. 14(7): 1747-1763 (2020) - [j28]Behrouz Kheirfam, Afsaneh Nasrollahi:
A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization. Optim. Lett. 14(8): 2549-2563 (2020)
2010 – 2019
- 2019
- [j27]M. Moslemi, Behrouz Kheirfam:
Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function. Optim. Lett. 13(1): 127-145 (2019) - [j26]Behrouz Kheirfam, Masoumeh Haghighi:
A wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function. Period. Math. Hung. 79(1): 94-105 (2019) - 2018
- [j25]Behrouz Kheirfam, Afsaneh Nasrollahi:
A Full-Newton Step Interior-point Method Based on a Class of Specific Algebra Transformation. Fundam. Informaticae 163(4): 325-337 (2018) - [j24]Behrouz Kheirfam, Maryam Chitsaz:
Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa )\) -LCP in a wide neighborhood of the central path. Period. Math. Hung. 76(2): 243-264 (2018) - 2017
- [j23]Behrouz Kheirfam:
A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood. Fundam. Informaticae 152(1): 33-50 (2017) - [j22]Behrouz Kheirfam, Mohaddeseh Mohamadi-Sangachin:
A Wide Neighborhood Second-order Predictor-corrector Interior-point Algorithm for Semidefinite Optimization with Modified Corrector Directions. Fundam. Informaticae 153(4): 327-346 (2017) - [j21]Behrouz Kheirfam:
An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞- neighbourhood of the central path. Int. J. Comput. Math. 94(12): 2271-2282 (2017) - [j20]Behrouz Kheirfam:
An infeasible full-NT step interior point algorithm for CQSCO. Numer. Algorithms 74(1): 93-109 (2017) - 2016
- [j19]Behrouz Kheirfam:
An Arc-search Interior Point Method in the 풩-∞ Neighborhood for Symmetric Optimization. Fundam. Informaticae 146(3): 255-269 (2016) - [j18]Behrouz Kheirfam:
A corrector-predictor path-following method for second-order cone optimization. Int. J. Comput. Math. 93(12): 2064-2078 (2016) - [j17]Behrouz Kheirfam:
An improved full-Newton step O(n) infeasible interior-point method for horizontal linear complementarity problem. Numer. Algorithms 71(3): 491-503 (2016) - [j16]Behrouz Kheirfam:
A full step infeasible interior-point method for Cartesian P∗(κ)-SCLCP. Optim. Lett. 10(3): 591-603 (2016) - 2015
- [j15]Behrouz Kheirfam:
An Adaptive Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semidefinite Optimization. J. Math. Model. Algorithms Oper. Res. 14(1): 55-66 (2015) - [j14]Behrouz Kheirfam:
A Corrector-Predictor Path-Following Method for Convex Quadratic Symmetric Cone Optimization. J. Optim. Theory Appl. 164(1): 246-260 (2015) - 2014
- [j13]K. Ahmadi, F. Hasani, Behrouz Kheirfam:
A Full-Newton Step Infeasible Interior-Point Algorithm Based on Darvay Directions for Linear Optimization. J. Math. Model. Algorithms Oper. Res. 13(2): 191-208 (2014) - [j12]Behrouz Kheirfam:
A Generic Interior-point Algorithm for Monotone Symmetric Cone Linear Complementarity Problems Based on a New Kernel Function. J. Math. Model. Algorithms Oper. Res. 13(4): 471-491 (2014) - [j11]Behrouz Kheirfam:
A New Complexity Analysis for Full-Newton Step Infeasible Interior-Point Algorithm for Horizontal Linear Complementarity Problems. J. Optim. Theory Appl. 161(3): 853-869 (2014) - [j10]Behrouz Kheirfam:
A predictor-corrector interior-point algorithm for P∗(κ)-horizontal linear complementarity problem. Numer. Algorithms 66(2): 349-361 (2014) - [j9]Behrouz Kheirfam, N. Mahdavi-Amiri:
A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem. Optim. Lett. 8(3): 1017-1029 (2014) - 2013
- [j8]Behrouz Kheirfam:
A new infeasible interior-point method based on Darvay's technique for symmetric optimization. Ann. Oper. Res. 211(1): 209-224 (2013) - [j7]Behrouz Kheirfam, K. Ahmadi, F. Hasani:
A modified Full-Newton Step Infeasible interior-Point Algorithm for Linear Optimization. Asia Pac. J. Oper. Res. 30(6) (2013) - [j6]Behrouz Kheirfam, José L. Verdegay:
The dual simplex method and sensitivity analysis for fuzzy linear programming with symmetric trapezoidal numbers. Fuzzy Optim. Decis. Mak. 12(2): 171-189 (2013) - [j5]Behrouz Kheirfam, Nezam Mahdavi-Amiri:
New complexity analysis of a full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization. Kybernetika 49(6): 883-896 (2013) - [c1]Behrouz Kheirfam, José L. Verdegay:
Optimization and Reoptimization in Fuzzy Linear Programming problems. EUSFLAT Conf. 2013 - 2012
- [j4]Behrouz Kheirfam:
A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function. Algorithmic Oper. Res. 7(2) (2012) - [j3]Behrouz Kheirfam, José L. Verdegay:
Strict sensitivity analysis in fuzzy quadratic programming. Fuzzy Sets Syst. 198: 99-111 (2012) - [j2]Behrouz Kheirfam:
Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step. Numer. Algorithms 59(4): 589-606 (2012) - [j1]Behrouz Kheirfam:
Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term. Numer. Algorithms 61(4): 659-680 (2012)
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-12-26 01:51 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:
