An improved version of Chubanov's method for solving a homogeneous feasibility problem
From MaRDI portal
Publication:4638910
DOI10.1080/10556788.2017.1368509zbMath1398.90173OpenAlexW2754872025MaRDI QIDQ4638910
Publication date: 2 May 2018
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2017.1368509
Related Items (10)
Implementation of a projection and rescaling algorithm for second-order conic feasibility problems ⋮ Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems ⋮ Solving conic systems via projection and rescaling ⋮ A new extension of Chubanov's method to symmetric cones ⋮ Computational Complexity of Atomic Chemical Reaction Networks ⋮ An extension of Chubanov's algorithm to symmetric cones ⋮ A Data-Independent Distance to Infeasibility for Linear Conic Systems ⋮ Enhanced basic procedures for the projection and rescaling algorithm ⋮ Computational performance of a projection and rescaling algorithm ⋮ Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial projection algorithm for linear feasibility problems
- 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
- Solving conic systems via projection and rescaling
- An extension of Chubanov's algorithm to symmetric cones
- On Chubanov’s Method for Solving a Homogeneous Inequality System
- The Duality Between the Perceptron Algorithm and the von Neumann Algorithm
- Systems of distinct representatives and linear algebra
This page was built for publication: An improved version of Chubanov's method for solving a homogeneous feasibility problem
