Examples with decreasing largest inscribed ball for deterministic rescaling algorithms
From MaRDI portal
Recommendations
- A deterministic rescaled perceptron algorithm
- An efficient rescaled perceptron algorithm for conic systems
- An Efficient Re-scaled Perceptron Algorithm for Conic Systems
- An improved deterministic rescaling for linear programming algorithms
- A simple polynomial-time rescaling algorithm for solving linear programs
Cites work
- A deterministic rescaled perceptron algorithm
- A family of linear programming algorithms based on an algorithm by von Neumann
- A simple polynomial-time rescaling algorithm for solving linear programs
- Colourful Linear Programming and its Relatives
- Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 3314813 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- The colourful feasibility problem
- The Duality Between the Perceptron Algorithm and the von Neumann Algorithm
Cited in
(2)
This page was built for publication: Examples with decreasing largest inscribed ball for deterministic rescaling algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5884386)