On linear programming and matrix scaling over the algebraic numbers

DOI10.1016/S0024-3795(97)80036-5MaRDI QIDQ1361844zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

matrix scalingreal algebraic numberspolynomial-time interior-point algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Conditioning of matrices (15A12)

Recommendations

• Polynomial algorithms for linear programming over the algebraic numbers
• Exact algorithms for linear programming over algebraic extensions
• Linear Programming in O([n3/ln n]L) Operations
• Rescaling algorithms for linear conic feasibility
• Diagonal Matrix Scaling and Linear Programming

Cites work

• scientific article; zbMATH DE number 4083375 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3637614 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 828002 (Why is no real title available?)
• scientific article; zbMATH DE number 4197755 (Why is no real title available?)
• A new polynomial-time algorithm for linear programming
• A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices
• An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
• Diagonal Matrix Scaling and Linear Programming
• Polynomial algorithms for linear programming over the algebraic numbers
• Scaling of matrices to achieve specified row and column sums

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)