An interior point method for solving systems of linear equations and inequalities.
Markku KallioSeppo SaloPublished in: Oper. Res. Lett. (2000)
Keyphrases
- systems of linear equations
- coefficient matrix
- interior point methods
- convex optimization
- linear programming
- linear systems
- linear program
- primal dual
- semidefinite programming
- computationally intensive
- sufficient conditions
- quadratic programming
- solving problems
- dynamic programming
- machine learning
- principal component analysis