Matrix partitioning methods for interior point algorithms.

DOI10.1007/BF02745580zbMath1075.90559MaRDI QIDQ5955804

Romesh Saigal

Publication date: 18 February 2002

Published in: Sādhanā (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51)

Related Items (1)

A Sherman-Morrison approach to the solution of linear systems

Uses Software

• LOQO

Cites Work

• Unnamed Item
• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• A variation on Karmarkar’s algorithm for solving linear programming problems
• LOQO user's manual — version 3.10

This page was built for publication: Matrix partitioning methods for interior point algorithms.