On Chubanov’s Method for Solving a Homogeneous Inequality System

DOI10.1007/978-3-319-17689-5_13zbMath1330.65090OpenAlexW2278953265MaRDI QIDQ3462316

Kees Roos

Publication date: 5 January 2016

Published in: Numerical Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-17689-5_13

zbMATH Keywords

algorithmnumerical experimentpolynomial-timelinear homogeneous systems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Linear inequalities of matrices (15A39) Iterative numerical methods for linear systems (65F10)

Related Items (4)

Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems ⋮ Rescaled Coordinate Descent Methods for Linear Programming ⋮ Rescaling Algorithms for Linear Conic Feasibility ⋮ An improved version of Chubanov's method for solving a homogeneous feasibility problem

Uses Software

• SeDuMi

Cites Work

• Unnamed Item
• Unnamed Item
• A strongly polynomial algorithm for linear systems having a binary solution
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
• A simple algebraic proof of Farkas's lemma and related theorems
• The Duality Between the Perceptron Algorithm and the von Neumann Algorithm
• Systems of distinct representatives and linear algebra

This page was built for publication: On Chubanov’s Method for Solving a Homogeneous Inequality System