# An Extension of Chubanov's Polynomial-Time Linear Programming Algorithm to Second-Order Cone Programming

arXiv: https://arxiv.org/abs/1611.01898 · HTML: https://mlsanity.com/paper/1611.01898/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 7 Nov 2016.

## Built on by (most cited first, 1 of 1)

- [Bayesian Regret Minimization in Offline Bandits](https://mlsanity.com/paper/2306.01237/) (2023)

## Abstract (arXiv)

Recently, Chubanov proposed an interesting new polynomial-time algorithm for linear program. In this paper, we extend his algorithm to second-order cone programming.