Recommendations
Cites work
- A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
- A primal-dual interior point method whose running time depends only on the constraint matrix
- Condition numbers for polyhedra with real number data
- Identifying an optimal basis in linear programming
- On scaled projections and pseudoinverses
- Stable Numerical Algorithms for Equilibrium Systems
Cited in
(9)- Weighted projections and Riesz frames
- Angle condition number of real matrices
- scientific article; zbMATH DE number 2074989 (Why is no real title available?)
- scientific article; zbMATH DE number 123978 (Why is no real title available?)
- On the condition numbers for polyhedra in Karmarkar's form
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
- Condition numbers and their condition numbers
- Normalized Frobenius condition number of the orthogonal projections of the identity
- A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms
This page was built for publication: A note on properties of condition numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362668)