Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
From MaRDI portal
Publication:5870377
DOI10.1287/moor.2021.1235OpenAlexW4206895713MaRDI QIDQ5870377
Publication date: 9 January 2023
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.08911
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)
Related Items (1)
Cites Work
- Some preconditioners for systems of linear inequalities
- 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
- Solving conic systems via projection and rescaling
- An extension of Chubanov's algorithm to symmetric cones
- An improved deterministic rescaling for linear programming algorithms
- Condition
- A Smooth Perceptron Algorithm
- An Efficient Rescaled Perceptron Algorithm for Conic Systems
- Rescaled Coordinate Descent Methods for Linear Programming
- The Relaxation Method for Solving Systems of Linear Inequalities
- Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
- An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming
- An improved version of Chubanov's method for solving a homogeneous feasibility problem
- Rescaling Algorithms for Linear Conic Feasibility
- A simple polynomial-time rescaling algorithm for solving linear programs
- A new condition number for linear programming
- A deterministic rescaled perceptron algorithm
This page was built for publication: Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
