34 citations · 93 across the 13 of their papers we have counts for
16 papers
On relaxations of the max -cut problem formulations
Ramin Fakhimi, Hamidreza Validi, Illya V. Hicks +2
A tight continuous relaxation is a crucial factor in solving mixed integer formulations of many NP-hard combinatorial optimization problems. The (weighted) max -cut problem is a…
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…
Solving the semidefinite relaxation of QUBOs in matrix multiplication time, and faster with a quantum computer
Brandon Augustino, Giacomo Nannicini, Tamás Terlaky +1
Recent works on quantum algorithms for solving semidefinite optimization (SDO) problems have leveraged a quantum-mechanical interpretation of positive semidefinite matrices to deve…
Quantum Interior Point Methods for Semidefinite Optimization
Brandon Augustino, Giacomo Nannicini, Tamás Terlaky +1
We present two quantum interior point methods for semidefinite optimization problems, building on recent advances in quantum linear system algorithms. The first scheme, more simila…