A polynomial projection algorithm for linear feasibility problems
From MaRDI portal
Recommendations
- A polynomial projection-type algorithm for linear programming
- Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem
- A new polynomial-time algorithm for linear programming
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem
- A primal-dual projection method for solving systems of linear inequalities
Cites work
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A strongly polynomial algorithm for linear systems having a binary solution
- On the Implementation of a Primal-Dual Interior Point Method
- On the non-polynomiality of the relaxation method for systems of linear inequalities
- Systems of distinct representatives and linear algebra
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Solving Systems of Linear Inequalities
- The many facets of linear programming
- Updating the Inverse of a Matrix
Cited in
(29)- Rescaling algorithms for linear conic feasibility
- scientific article; zbMATH DE number 4181135 (Why is no real title available?)
- A procedure of Chvátal for testing feasibility in linear programming and matrix scaling
- Implementation of a projection and rescaling algorithm for second-order conic feasibility problems
- A note on submodular function minimization by Chubanov's LP algorithm
- A polynomial-time descent method for separable convex optimization problems with linear constraints
- Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
- Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
- scientific article; zbMATH DE number 4110452 (Why is no real title available?)
- Method of alternating contractions and its applications to some convex optimization problems
- Computational performance of a projection and rescaling algorithm
- An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming
- A polynomial algorithm for convex quadratic optimization subject to linear inequalities
- Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems
- A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference
- Solving conic systems via projection and rescaling
- An extension of Chubanov's algorithm to symmetric cones
- An improved version of Chubanov's method for solving a homogeneous feasibility problem
- A data-independent distance to infeasibility for linear conic systems
- Rescaled coordinate descent methods for linear programming
- Enhanced basic procedures for the projection and rescaling algorithm
- A new extension of Chubanov's method to symmetric cones
- Minimizing convex functions with rational minimizers
- Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem
- Generation of interior points and polyhedral representations of cones in \(\mathbb R^N\) cut by \(M\) planes sharing a common point
- A polynomial projection-type algorithm for linear programming
- Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration
- A condition-based algorithm for solving polyhedral feasibility problems
This page was built for publication: A polynomial projection algorithm for linear feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q747780)
