Rescaled coordinate descent methods for linear programming

DOI10.1007/978-3-319-33461-5_3MaRDI QIDQ3186489zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Rescaling algorithms for linear conic feasibility
• Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
• A simple polynomial-time rescaling algorithm for solving linear programs
• A new polynomial-time algorithm for linear programming
• Diagonal Matrix Scaling and Linear Programming

Cites work

• A deterministic rescaled perceptron algorithm
• A polynomial projection algorithm for linear feasibility problems
• A polynomial projection-type algorithm for linear programming
• A simple polynomial-time rescaling algorithm for solving linear programs
• A smooth perceptron algorithm
• A strongly polynomial algorithm for linear systems having a binary solution
• Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
• Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
• Finding the nearest point in A polytope
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• On Chubanov's Method for Linear Programming
• On Chubanov's method for solving a homogeneous inequality system
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Solving Systems of Linear Inequalities

Cited in

(7)

• Rescaled pure greedy algorithm for convex optimization
• scientific article; zbMATH DE number 4078635 (Why is no real title available?)
• Rescaling algorithms for linear conic feasibility
• scientific article; zbMATH DE number 966589 (Why is no real title available?)
• Computational performance of a projection and rescaling algorithm
• Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
• Implementation of a projection and rescaling algorithm for second-order conic feasibility problems

This page was built for publication: Rescaled coordinate descent methods for linear programming

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