|
|
(5 intermediate revisions by 5 users not shown) |
| Property / review text |
| | The author proposes a strongly polynomial-time algorithm for the strict homogeneous linear- inequality feasibility problem in the positive orthant, that is, to obtain \(x \in \mathbb R^n\), such that \(A x > 0\), \(x >0\), for an \(m \times n\) matrix \(A\), \(m \leq n\). An extension to the non-homogeneous linear feasibility problem is presented. |
| Property / review text: The author proposes a strongly polynomial-time algorithm for the strict homogeneous linear- inequality feasibility problem in the positive orthant, that is, to obtain \(x \in \mathbb R^n\), such that \(A x > 0\), \(x >0\), for an \(m \times n\) matrix \(A\), \(m \leq n\). An extension to the non-homogeneous linear feasibility problem is presented. / rank |
| | Normal rank |
| Property / reviewed by |
| | |
| Property / reviewed by: Hans Benker / rank |
| | Normal rank |
| Property / Mathematics Subject Classification ID |
| | |
| Property / Mathematics Subject Classification ID: 65K05 / rank |
| | Normal rank |
| Property / Mathematics Subject Classification ID |
| | |
| Property / Mathematics Subject Classification ID: 15A39 / rank |
| | Normal rank |
| Property / Mathematics Subject Classification ID |
| | |
| Property / Mathematics Subject Classification ID: 90C05 / rank |
| | Normal rank |
| Property / zbMATH DE Number |
| | |
| Property / zbMATH DE Number: 6387655 / rank |
| | Normal rank |
| Property / zbMATH Keywords |
| | strict linear-inequality feasibility |
| Property / zbMATH Keywords: strict linear-inequality feasibility / rank |
| | Normal rank |
| Property / zbMATH Keywords |
| | linear programming |
| Property / zbMATH Keywords: linear programming / rank |
| | Normal rank |
| Property / zbMATH Keywords |
| | strong polynomial method |
| Property / zbMATH Keywords: strong polynomial method / rank |
| | Normal rank |
| Property / zbMATH Keywords |
| | application of nonlinear programming to feasibility problems |
| Property / zbMATH Keywords: application of nonlinear programming to feasibility problems / rank |
| | Normal rank |
| Property / describes a project that uses |
| | |
| Property / describes a project that uses: ART3+ / rank |
| | Normal rank |
| Property / MaRDI profile type |
| | |
| Property / MaRDI profile type: MaRDI publication profile / rank |
| | Normal rank |
| Property / full work available at URL |
| | |
| Property / full work available at URL: https://doi.org/10.1007/s00186-014-0480-y / rank |
| | Normal rank |
| Property / OpenAlex ID |
| | |
| Property / OpenAlex ID: W2014479920 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The Relaxation Method for Linear Inequalities / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A primal-dual interior point method whose running time depends only on the constraint matrix / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On Chubanov's Method for Linear Programming / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On Projection Algorithms for Solving Convex Feasibility Problems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: New methods for linear inequalities / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q5769827 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A strongly polynomial algorithm for linear systems having a binary solution / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the complexity of solving feasible systems of linear inequalities specified with approximate data / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the non-polynomiality of the relaxation method for systems of linear inequalities / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The method of projections for finding the common point of convex sets / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Fundamentals of Computerized Tomography / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Relaxation methods for image reconstruction / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: An Algorithm for Linear Inequalities and its Applications / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: La méthode des centres dans un espace topologique / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q5535546 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4197641 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the complexity of approximating the maximal inscribed ellipsoid for a polytope / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Solvability and Consistency for Linear Equations and Inequalities / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On a relaxation method of solving systems of linear inequalities / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The Relaxation Method for Linear Inequalities / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3967358 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Location of the Maximum on Unimodal Surfaces / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3028166 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q5187067 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4204004 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A new algorithm for minimizing convex functions over convex sets / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: How partial knowledge helps to solve linear programs / rank |
| | Normal rank |
links / mardi / name | links / mardi / name |
| | |