Ramin Fakhimi

Ramin Fakhimi

Auto-generated profile, based on publicly available information

Ramin Fakhimi

Quantum Computing and Optimization Lab, Industrial and System Engineering Department, Lehigh University, Bethlehem, PA 18015 USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 October 2025 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
mohammadhossein mohammadisiahroudimohammadhossein mohammadisiahroudi
mohammadhossein mohammadisiahroudi
RFRamin Fakhimi
Ramin Fakhimi
ZWZeguan Wu
Zeguan Wu
Tamás Sándor TerlakyTamás Sándor Terlaky
Tamás Sándor Terlaky
The use of quantum computing to accelerate complex optimization problems is a burgeoning research field. This paper applies Quantum Linear System Algorithms (QLSAs) to Newton systems within Interior Point Methods (IPMs) to take advantage of quantum speedup in solving Linear Optimization (LO) problems. Due to their inexact nature, QLSAs can be applied only to inexact variants of IPMs. Existing IPMs with inexact Newton directions are infeasible methods due to the inexact nature of their computations. This paper proposes an Inexact-Feasible IPM (IF-IPM) for LO problems, using a novel linear system to generate inexact but feasible steps. We show that this method has [Formula: see text] iteration complexity, analogous to the best exact IPMs, where [Formula: see text] is the number of variables and [Formula: see text] is the binary length of the input data. Moreover, we examine how QLSAs can efficiently solve the proposed system in an iterative refinement (IR) scheme to find the exact solution without excessive calls to QLSAs. We show that the proposed IR-IF-IPM can also be helpful to mitigate the impact of the condition number when a classical iterative method, such as a Conjugate Gradient method or a quantum solver is used at iterations of IPMs. After applying the proposed IF-IPM to the self-dual embedding formulation, we implement it and present illustrative numerical results.

3 July 2024 in Optimization Methods and Software
Verified
Journal Article
Closed access
mohammadhossein mohammadisiahroudimohammadhossein mohammadisiahroudi
mohammadhossein mohammadisiahroudi
RFRamin Fakhimi
Ramin Fakhimi
BABrandon Augustino
Brandon Augustino
Tamás Sándor TerlakyTamás Sándor Terlaky
Tamás Sándor Terlaky

9 August 2023 in Operations Research Letters
Verified
Journal Article
Closed access
RFRamin Fakhimi
Ramin Fakhimi
HVHamidreza Validi
Hamidreza Validi
IHIllya V. Hicks
Illya V. Hicks
TTTamás Terlaky
Tamás Terlaky
LZLuis F. Zuluaga
Luis F. Zuluaga