Rescaled Coordinate Descent Methods for Linear Programming

DOI10.1007/978-3-319-33461-5_3zbMath1419.90063OpenAlexW2491133435MaRDI QIDQ3186489

Daniel Dadush, Giacomo Zambelli, László A. Végh

Publication date: 10 August 2016

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: http://eprints.lse.ac.uk/84479/1/Vegh_Rescaled%20coordinate_2017.pdf

Mathematics Subject Classification ID

Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Related Items (4)

Implementation of a projection and rescaling algorithm for second-order conic feasibility problems ⋮ Rescaling Algorithms for Linear Conic Feasibility ⋮ Computational performance of a projection and rescaling algorithm ⋮ Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems

Cites Work

• Unnamed Item
• Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem
• A strongly polynomial algorithm for linear systems having a binary solution
• A polynomial projection algorithm for linear feasibility problems
• Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
• A polynomial projection-type algorithm for linear programming
• A Smooth Perceptron Algorithm
• On Chubanov's Method for Linear Programming
• On Chubanov’s Method for Solving a Homogeneous Inequality System
• The Relaxation Method for Solving Systems of Linear Inequalities
• Finding the nearest point in A polytope
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• A simple polynomial-time rescaling algorithm for solving linear programs
• A deterministic rescaled perceptron algorithm

This page was built for publication: Rescaled Coordinate Descent Methods for Linear Programming