A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function. - Behrouz Kheirfam (Algorithmic Oper. Res., 2012)

Strict sensitivity analysis in fuzzy quadratic programming. - Behrouz Kheirfam; José L. Verdegay (Fuzzy Sets Syst., 2012)

Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step. - Behrouz Kheirfam (Numer. Algorithms, 2012)

Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term. - Behrouz Kheirfam (Numer. Algorithms, 2012)

Optimization and Reoptimization in Fuzzy Linear Programming problems. - Behrouz Kheirfam; José L. Verdegay (EUSFLAT Conf., 2013)

A new infeasible interior-point method based on Darvay's technique for symmetric optimization. - Behrouz Kheirfam (Ann. Oper. Res., 2013)

A modified Full-Newton Step Infeasible interior-Point Algorithm for Linear Optimization. - Behrouz Kheirfam; K. Ahmadi; F. Hasani (Asia Pac. J. Oper. Res., 2013)

The dual simplex method and sensitivity analysis for fuzzy linear programming with symmetric trapezoidal numbers. - Behrouz Kheirfam; José L. Verdegay (Fuzzy Optim. Decis. Mak., 2013)

New complexity analysis of a full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization. - Behrouz Kheirfam; Nezam Mahdavi-Amiri (Kybernetika, 2013)

A Full-Newton Step Infeasible Interior-Point Algorithm Based on Darvay Directions for Linear Optimization. - K. Ahmadi; F. Hasani; Behrouz Kheirfam (J. Math. Model. Algorithms Oper. Res., 2014)

A Generic Interior-point Algorithm for Monotone Symmetric Cone Linear Complementarity Problems Based on a New Kernel Function. - Behrouz Kheirfam (J. Math. Model. Algorithms Oper. Res., 2014)

A New Complexity Analysis for Full-Newton Step Infeasible Interior-Point Algorithm for Horizontal Linear Complementarity Problems. - Behrouz Kheirfam (J. Optim. Theory Appl., 2014)

A predictor-corrector interior-point algorithm for P∗(κ)-horizontal linear complementarity problem. - Behrouz Kheirfam (Numer. Algorithms, 2014)

A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem. - Behrouz Kheirfam; N. Mahdavi-Amiri (Optim. Lett., 2014)

An Adaptive Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semidefinite Optimization. - Behrouz Kheirfam (J. Math. Model. Algorithms Oper. Res., 2015)

A Corrector-Predictor Path-Following Method for Convex Quadratic Symmetric Cone Optimization. - Behrouz Kheirfam (J. Optim. Theory Appl., 2015)

An Arc-search Interior Point Method in the 풩-∞ Neighborhood for Symmetric Optimization. - Behrouz Kheirfam (Fundam. Informaticae, 2016)

A corrector-predictor path-following method for second-order cone optimization. - Behrouz Kheirfam (Int. J. Comput. Math., 2016)

An improved full-Newton step O(n) infeasible interior-point method for horizontal linear complementarity problem. - Behrouz Kheirfam (Numer. Algorithms, 2016)

A full step infeasible interior-point method for Cartesian P∗(κ)-SCLCP. - Behrouz Kheirfam (Optim. Lett., 2016)

A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood. - Behrouz Kheirfam (Fundam. Informaticae, 2017)

A Wide Neighborhood Second-order Predictor-corrector Interior-point Algorithm for Semidefinite Optimization with Modified Corrector Directions. - Behrouz Kheirfam; Mohaddeseh Mohamadi-Sangachin (Fundam. Informaticae, 2017)

An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞- neighbourhood of the central path. - Behrouz Kheirfam (Int. J. Comput. Math., 2017)

An infeasible full-NT step interior point algorithm for CQSCO. - Behrouz Kheirfam (Numer. Algorithms, 2017)

A Full-Newton Step Interior-point Method Based on a Class of Specific Algebra Transformation. - Behrouz Kheirfam; Afsaneh Nasrollahi (Fundam. Informaticae, 2018)

Polynomial convergence of two higher order interior-point methods for (P_*( kappa ) ) -LCP in a wide neighborhood of the central path. - Behrouz Kheirfam; Maryam Chitsaz (Period. Math. Hung., 2018)

Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function. - M. Moslemi; Behrouz Kheirfam (Optim. Lett., 2019)

A wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function. - Behrouz Kheirfam; Masoumeh Haghighi (Period. Math. Hung., 2019)

A corrector-predictor interior-point method with new search direction for linear optimization. - Zsolt Darvay; Tibor Illés; Behrouz Kheirfam; Petra Renáta Rigó (Central Eur. J. Oper. Res., 2020)

A Second-order Corrector Infeasible Interior-point Method with One-norm wide Neighborhood for Symmetric Optimization. - Behrouz Kheirfam (Fundam. Informaticae, 2020)

A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood. - Behrouz Kheirfam (Fundam. Informaticae, 2020)

A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps. - Behrouz Kheirfam; Masoumeh Haghighi (Numer. Algorithms, 2020)

A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization. - Zsolt Darvay; Behrouz Kheirfam; Petra Renáta Rigó (Optim. Lett., 2020)

A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization. - Behrouz Kheirfam; Afsaneh Nasrollahi (Optim. Lett., 2020)

A wide neighborhood interior-point algorithm based on the trigonometric kernel function. - Behrouz Kheirfam; Masoumeh Haghighi (J. Appl. Math. Comput., 2020)

A new search direction for full-Newton step infeasible interior-point method in linear optimization. - Behrouz Kheirfam (CoRR, 2021)

An predictor-corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood. - Behrouz Kheirfam; Mohaddeseh Mohamadi-Sangachin (Int. J. Comput. Math., 2021)

A Polynomial-Iteration Infeasible Interior-Point Algorithm with Arc-Search for Semidefinite optimization. - Behrouz Kheirfam (J. Sci. Comput., 2021)

A Second-Order Corrector Infeasible Interior-Point Method for Semidefinite Optimization Based on a Wide Neighborhood. - Behrouz Kheirfam; Afsaneh Nasrollahi; M. Mohammadi (J. Sci. Comput., 2021)

An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood. - Behrouz Kheirfam; Naser Osmanpour; Mohammad Keyanpour (Numer. Algorithms, 2021)

A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization. - Behrouz Kheirfam; Naser Osmanpour (J. Appl. Math. Comput., 2022)

Corrector-Predictor Interior-Point Method With New Search Direction for Semidefinite Optimization. - Behrouz Kheirfam (J. Sci. Comput., 2023)

A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term. - Safa Guerdouh; Wided Chikouche; Behrouz Kheirfam (J. Appl. Math. Comput., 2023)

Complexity Analysis of a Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems. - Behrouz Kheirfam (J. Optim. Theory Appl., 2024)

An efficient second-order predictor-corrector infeasible primal-dual IPM algorithm with large iteration path updates for solving well-known SDO problems. - Hadis Abedi; Behrouz Kheirfam (J. Comput. Appl. Math., 2025)