Matrix partitioning methods for interior point algorithms.

DOI10.1007/BF02745580MaRDI QIDQ5955804zbMATH OpenFDO

Authors Romesh Saigal

Publication date 18 February 2002

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

Full work available at URL https://doi.org/10.1007/BF02745580

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3816913 (Why is no real title available?)
• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• 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

Cited in

(1)

• A Sherman-Morrison approach to the solution of linear systems

Describes a project that uses

Uses Software

• LOQO

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5955804)