A preconditioned inexact infeasible quantum interior point method for linear optimization
Preprint
Abstract
Quantum Interior Point Methods (QIPMs) have been attracting significant interests recently due to their potential of solving optimization problems substantially faster than state-of-the-art conventional algorithms. In general, QIPMs use Quantum Linear System Algorithms (QLSAs) to substitute classical linear system solvers. However, the performance of QLSAs depends on the condition numbers of the linear systems, which are typically proportional to the square of the reciprocal of the duality gap in QIPMs. To improve conditioning, a preconditioned inexact infeasible QIPM (II-QIPM) based on optimal partition estimation is developed in this work. We improve the condition number of the linear systems in II-QIPMs from quadratic dependence on the reciprocal of the duality gap to linear, and obtain better dependence with respect to the accuracy when compared to other II-QIPMs. Our method also attains better dependence with respect to the dimension when compared to other inexact infeasible Interior Point Methods.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Quantum Algorithm for Linear Systems of EquationsPhysical Review Letters, 2009
- Convergence Analysis of the Inexact Infeasible Interior-Point Method for Linear OptimizationJournal of Optimization Theory and Applications, 2008
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programmingComputational Optimization and Applications, 2007
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear OptimizationSIAM Journal on Optimization, 2006
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear ProgrammingSIAM Journal on Optimization, 1996
- Interior-Point Polynomial Algorithms in Convex Programming1994
- Degeneracy in interior point methods for linear programming: a surveyAnnals of Operations Research, 1993
- Some interlacing properties of the Schur complement of a Hermitian matrixLinear Algebra and its Applications, 1992
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Direct Methods for Solving Symmetric Indefinite Systems of Linear EquationsSIAM Journal on Numerical Analysis, 1971