On Chubanov's method for solving a homogeneous inequality system

DOI10.1007/978-3-319-17689-5_13MaRDI QIDQ3462316zbMATH OpenOpenAlexFDO

Authors 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 experimentlinear homogeneous systemspolynomial-time

Mathematics Subject Classification ID

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

Recommendations

• An improved version of Chubanov's method for solving a homogeneous feasibility problem
• Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems
• On Chubanov's Method for Linear Programming
• An extension of Chubanov's algorithm to symmetric cones
• A procedure of Chvátal for testing feasibility in linear programming and matrix scaling

Cites work

• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• A polynomial-time algorithm, based on Newton's method, for linear programming
• A simple algebraic proof of Farkas's lemma and related theorems
• A strongly polynomial algorithm for linear systems having a binary solution
• Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
• Systems of distinct representatives and linear algebra
• The Duality Between the Perceptron Algorithm and the von Neumann Algorithm

Cited in

(8)

• A new extension of Chubanov's method to symmetric cones
• On Chubanov's Method for Linear Programming
• An improved version of Chubanov's method for solving a homogeneous feasibility problem
• Rescaling algorithms for linear conic feasibility
• Rescaled coordinate descent methods for linear programming
• Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems
• The construction of multidimensional membership functions and its application to feasibility problems
• A symmetry-based explanation of the main idea behind Chubanov's linear programming algorithm

Describes a project that uses

Uses Software

• SeDuMi

This page was built for publication: On Chubanov's method for solving a homogeneous inequality system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3462316)