Efficient Use of Quantum Linear System Algorithms in Inexact Infeasible IPMs for Linear Optimization

Quantum computing has attracted significant interest in the optimization community because it potentially can solve classes of optimization problems faster than conventional supercomputers. Several researchers proposed quantum computing methods, especially quantum interior point methods (QIPMs), to...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of optimization theory and applications Vol. 202; no. 1; pp. 146 - 183
Main Authors:	Mohammadisiahroudi, Mohammadhossein, Fakhimi, Ramin, Terlaky, Tamás
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2024 Springer Nature B.V
Subjects:	Algorithms Applications of Mathematics Calculus of Variations and Optimal Control; Optimization Conjugate gradient method Engineering Error analysis Exact solutions Linear systems Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Quantum computing Simulators Solvers Theory of Computation Quantum linear system algorithm 90C51 Quantum interior point method 81P68 Iterative refinement 90C05 Linear optimization
ISSN:	0022-3239, 1573-2878
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!