An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization

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 polynomial-time algorithms for solving optimization problems. IPMs solve a Newton linear system at each iteration to com...

Descripción completa

Detalles Bibliográficos
Autores principales: Wu, Zeguan, Mohammadisiahroudi, Mohammadhossein, Augustino, Brandon, Yang, Xiu, Terlaky, Tamás
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2023
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9956007/
https://www.ncbi.nlm.nih.gov/pubmed/36832696
http://dx.doi.org/10.3390/e25020330

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9956007/
https://www.ncbi.nlm.nih.gov/pubmed/36832696
http://dx.doi.org/10.3390/e25020330

Ejemplares similares