A polynomial projection algorithm for linear feasibility problems
From MaRDI portal
Publication:747780
DOI10.1007/S10107-014-0823-8zbMATH Open1327.90102OpenAlexW2040392433MaRDI QIDQ747780FDOQ747780
Publication date: 19 October 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-014-0823-8
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
- On the Implementation of a Primal-Dual Interior Point Method
- A new polynomial-time algorithm for linear programming
- Updating the Inverse of a Matrix
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Title not available (Why is that?)
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The many facets of linear programming
- On the non-polynomiality of the relaxation method for systems of linear inequalities
- A strongly polynomial algorithm for linear systems having a binary solution
- Systems of distinct representatives and linear algebra
- The Relaxation Method for Solving Systems of Linear Inequalities
Cited In (26)
- A polynomial-time descent method for separable convex optimization problems with linear constraints
- Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem
- A Data-Independent Distance to Infeasibility for Linear Conic Systems
- Generation of interior points and polyhedral representations of cones in \(\mathbb R^N\) cut by \(M\) planes sharing a common point
- Rescaled Coordinate Descent Methods for Linear Programming
- Minimizing convex functions with rational minimizers
- Rescaling Algorithms for Linear Conic Feasibility
- Computational performance of a projection and rescaling algorithm
- A note on submodular function minimization by Chubanov's LP algorithm
- Title not available (Why is that?)
- An improved version of Chubanov's method for solving a homogeneous feasibility problem
- 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
- Method of Alternating Contractions and Its Applications to Some Convex Optimization Problems
- Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration
- Enhanced basic procedures for the 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
- Solving conic systems via projection and rescaling
- 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
- Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
- Computational Complexity of Atomic Chemical Reaction Networks
- Title not available (Why is that?)
- An extension of Chubanov's algorithm to symmetric cones
- A new extension of Chubanov's method to symmetric cones
Uses Software
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)
