scientific article; zbMATH DE number 1336278

MaRDI QIDQ4258626zbMATH OpenFDO

Authors Josef Stoer, Gongyun Zhao, Gy. Sonnevend

Publication date 14 September 1999

zbMATH Keywords

inner-point methodlinear programmingsubspace method

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Extending Mehrotra's corrector for linear programs
• On the complexity of following the central path of linear programs by linear extrapolation. II
• Path-Following Methods for Linear Programming
• New trajectory-following polynomial-time algorithm for linear programming problems

Cited in

(7)

• Numerical representations of a universal subspace flow for linear programs
• The sublinear operator method and selector problems
• Multiple centrality corrections in a primal-dual method for linear programming
• Linear relaxations and reduced-Cost based propagation of continuous variable subscripts
• Extending Mehrotra's corrector for linear programs
• Computing reducing subspaces of a large linear matrix pencil
• A Subspace‐Based Method for Solving Lagrange–Sylvester Interpolation Problems

This page was built for publication:

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