Improved complexity results on solving real-number linear feasibility problems
From MaRDI portal
Recommendations
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals
- On the complexity of solving feasible systems of linear inequalities specified with approximate data
- On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data
- NP-hardness of approximately solving linear equations over reals
- Computational complexity of real powering and improved solving linear differential equations
- A generalization of the integer linear infeasibility problem
- Efficient solving of quantified inequality constraints over the real numbers
- On the complexity of linear programming under finite precision arithmetic
- Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem
- Improved deterministic algorithms for linear programming in low dimensions
Cites work
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 1489800 (Why is no real title available?)
- scientific article; zbMATH DE number 194636 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 1859212 (Why is no real title available?)
- A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
- A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm
- A Variant of the Vavasis--Ye Layered-Step Interior-Point Algorithm for Linear Programming
- A modified layered-step interior-point algorithm for linear programming
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A primal-dual interior point method whose running time depends only on the constraint matrix
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
- Identifying an optimal basis in linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- Linear programming, complexity theory and elementary functional analysis
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On Linear Least-Squares Problems with Diagonally Dominant Weight Matrices
- On scaled projections and pseudoinverses
- On the complexity of following the central path of linear programs by linear extrapolation. II
- On the finite convergence of interior-point algorithms for linear programming
- Path-Following Methods for Linear Programming
- Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system
- The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
Cited in
(8)- Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals
- Computational complexity of real powering and improved solving linear differential equations
- A condition-based algorithm for solving polyhedral feasibility problems
- Faster real feasibility via circuit discriminants
- Improved complexity bounds for location problems on the real line
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
- Condition numbers for polyhedra with real number data
This page was built for publication: Improved complexity results on solving real-number linear feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490340)
