A preconditioned inexact infeasible quantum interior point method for linear optimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- scientific article; zbMATH DE number 781821 (Why is no real title available?)
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- A new polynomial-time algorithm for linear programming
- An Identity for the Schur Complement of a Matrix
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- An inexact feasible interior point method for linear optimization with high adaptability to quantum computers
- Convergence analysis of the inexact infeasible interior-point method for linear optimization
- Degeneracy in interior point methods for linear programming: A survey
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
- Efficient use of quantum linear system algorithms in inexact infeasible IPMs for linear optimization
- Inexact Newton Methods
- Interior Point Methods for Nonlinear Optimization
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Quantum tomography using state-preparation unitaries
- Some interlacing properties of the Schur complement of a Hermitian matrix
This page was built for publication: A preconditioned inexact infeasible quantum interior point method for linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6844264)