19 citations · 24 across the 11 of their papers we have counts for
7 papers · 1 filter
A quantum dual logarithmic barrier method for linear optimization
Zeguan Wu, Pouya Sampourmahani, Mohammadhossein Mohammadisiahroudi +1
Quantum computing has the potential to speed up some optimization methods. One can use quantum computers to solve linear systems via Quantum Linear System Algorithms (QLSAs). QLSAs…
Quantum Computing Inspired Iterative Refinement for Semidefinite Optimization
Mohammadhossein Mohammadisiahroudi, Brandon Augustino, Pouya Sampourmahani +1
Iterative Refinement (IR) is a classical computing technique for obtaining highly precise solutions to linear systems of equations, as well as linear optimization problems. In this…
Improvements to Quantum Interior Point Method for Linear Optimization
Mohammadhossein Mohammadisiahroudi, Zeguan Wu, Brandon Augustino +2
Quantum linear system algorithms (QLSA) have the potential to speed up Interior Point Methods (IPM). However, a major challenge is that QLSAs are inexact and sensitive to the condi…
An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
Mohammadhossein Mohammadisiahroudi, Ramin Fakhimi, Zeguan Wu +1
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 syste…
Generating Linear, Semidefinite, and Second-order Cone Optimization Problems for Numerical Experiments
Mohammadhossein Mohammadisiahroudi, Ramin Fakhimi, Brandon Augustino +1
The numerical performance of algorithms can be studied using test sets or procedures that generate such problems. This paper proposes various methods for generating linear, semidef…
On Semidefinite Representations of Second-order Conic Optimization Problems
Pouya Sampourmahani, Mohammadhossein Mohammadisiahroudi, Tamás Terlaky
Second-order conic optimization (SOCO) can be considered as a special case of semidefinite optimization (SDO). In the literature it has been advised that a SOCO problem can be embe…
An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization
Zeguan Wu, Mohammadhossein Mohammadisiahroudi, Brandon Augustino +2
Quantum linear system algorithms (QLSAs) have the potential to speed up algorithms that rely on solving linear systems. Interior Point Methods (IPMs) yield a fundamental family of…