Pages that link to "Item:Q705124"
From MaRDI portal
The following pages link to Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem (Q705124):
Displaying 18 items.
- Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384506) (← links)
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939) (← links)
- A polynomial projection algorithm for linear feasibility problems (Q747780) (← links)
- The colourful feasibility problem (Q944700) (← links)
- A polynomial projection-type algorithm for linear programming (Q1667181) (← links)
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem (Q1686516) (← links)
- A simple method for convex optimization in the oracle model (Q2164690) (← links)
- Improved complexity results on solving real-number linear feasibility problems (Q2490340) (← links)
- On Chubanov's Method for Linear Programming (Q2962562) (← links)
- Rescaled Coordinate Descent Methods for Linear Programming (Q3186489) (← links)
- Geometric Rescaling Algorithms for Submodular Function Minimization (Q4958557) (← links)
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin (Q4999361) (← links)
- Rescaling Algorithms for Linear Conic Feasibility (Q5119854) (← links)
- A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility (Q5372620) (← links)
- Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems (Q5870377) (← links)
- A deterministic rescaled perceptron algorithm (Q5962726) (← links)
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)
- A simple method for convex optimization in the oracle model (Q6589751) (← links)
