Solving linear systems in interior-point methods

DOI10.1016/S0305-0548(00)00003-4zbMath0993.65072WikidataQ126338717 ScholiaQ126338717MaRDI QIDQ5959078

Soondal Park, Tongryeol Seol

Publication date: 26 September 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

linear systemsinterior-point methodssparsityintegrated approachnormal equation approachSchur complement method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The role of the augmented system in interior point methods
• A primal-dual infeasible-interior-point algorithm for linear programming
• Multiple centrality corrections in a primal-dual method for linear programming
• On the Implementation of a Primal-Dual Interior Point Method
• Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm
• A modified Schur-complement method for handling dense columns in interior-point methods for linear programming

This page was built for publication: Solving linear systems in interior-point methods