On linear programming and matrix scaling over the algebraic numbers
From MaRDI portal
Publication:1361844
DOI10.1016/S0024-3795(97)80036-5zbMATH Open0885.90079OpenAlexW2056053749WikidataQ114850254 ScholiaQ114850254MaRDI QIDQ1361844FDOQ1361844
Authors: Bahman Kalantari, M. Reza Emamy-K. 
Publication date: 1997
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0024-3795(97)80036-5
Recommendations
Cites Work
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices
- Scaling of matrices to achieve specified row and column sums
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Diagonal Matrix Scaling and Linear Programming
- Polynomial algorithms for linear programming over the algebraic numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
- Semidefinite programming and matrix scaling over the semidefinite cone.
- Exact algorithms for linear programming over algebraic extensions
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
- On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
- A characterization theorem and an algorithm for a convex hull problem
This page was built for publication: On linear programming and matrix scaling over the algebraic numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361844)
