Solving linear systems in interior-point methods
There are two approaches to solve the linear systems in interior-point methods: the normal equation approach and the augmented system approach. The authors integrate the two methods by applying matrix partitioning to the augmented system approach. Specifically, it is shown that the Schur complement method which is applied to problems whiteness columns is a special case of the augmented system approach. This property is used for the integrates approach. If the integrated approach is used, linear systems can be solved maintaining sparsity of matrices without respect of the existence of dense columns.
- An interior point method for solving systems of linear equations and inequalities
- An interior point method for linear programming
- scientific article; zbMATH DE number 4031392
- scientific article; zbMATH DE number 1069182
- scientific article; zbMATH DE number 617917
- scientific article; zbMATH DE number 1424085
- Publication:3026189
- Interior point algorithms in linear optimization
- A modified Schur-complement method for handling dense columns in interior-point methods for linear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 1047679 (Why is no real title available?)
- Multiple centrality corrections in a primal-dual method for linear programming
- On the Implementation of a Primal-Dual Interior Point Method
- The role of the augmented system in interior point methods
This page was built for publication: Solving linear systems in interior-point methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959078)