An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915370787405824 |
|---|---|
| author | Mohammadisiahroudi, Mohammadhossein Fakhimi, Ramin Wu, Zeguan Terlaky, Tamás |
| author_facet | Mohammadisiahroudi, Mohammadhossein Fakhimi, Ramin Wu, Zeguan Terlaky, Tamás |
| contents | 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 $\Ocal(\sqrt{n}L)$ iteration complexity, analogous to the best exact IPMs, where $n$ is the number of variables and $L$ 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 investigate the proposed IF-IPM's efficiency using the QISKIT simulator of QLSA. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2307_14445 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers Mohammadisiahroudi, Mohammadhossein Fakhimi, Ramin Wu, Zeguan Terlaky, Tamás Optimization and Control 90C51, 90C05, 68Q12, 81P68 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 $\Ocal(\sqrt{n}L)$ iteration complexity, analogous to the best exact IPMs, where $n$ is the number of variables and $L$ 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 investigate the proposed IF-IPM's efficiency using the QISKIT simulator of QLSA. |
| title | An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers |
| topic | Optimization and Control 90C51, 90C05, 68Q12, 81P68 |
| url | https://arxiv.org/abs/2307.14445 |