Finite convergence into a convex polytope via facet reflections. (Q6175140): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3160276 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4821526 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3592129 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A polynomial-time algorithm, based on Newton's method, for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm / rank | |||
Normal rank | |||
Revision as of 15:36, 2 August 2024
scientific article; zbMATH DE number 7729503
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finite convergence into a convex polytope via facet reflections. |
scientific article; zbMATH DE number 7729503 |
Statements
Finite convergence into a convex polytope via facet reflections. (English)
0 references
17 August 2023
0 references
convex geometry
0 references
optimization
0 references
infeasible start
0 references
strategy games
0 references
