An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization.
Zeguan WuMohammadhossein MohammadisiahroudiBrandon AugustinoXiu YangTamás TerlakyPublished in: Entropy (2023)
Keyphrases
- quadratic optimization
- interior point methods
- linearly constrained
- variational inequalities
- primal dual
- convex optimization
- linear constraints
- linear programming
- linear program
- quadratic programming
- semidefinite programming
- solving problems
- convex sets
- computationally intensive
- machine learning
- low rank
- approximation algorithms
- model selection
- image processing
- learning algorithm