Finite convergence into a convex polytope via facet reflections.

DOI10.21136/am.2022.0134-22OpenAlexW4308044522MaRDI QIDQ6175140

Douglas J. Lafountain, B. Petracovici, Dinesh B. Ekanayake

Publication date: 17 August 2023

Published in: Applications of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.21136/am.2022.0134-22

zbMATH Keywords

optimizationconvex geometryinfeasible startstrategy games

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Approximation methods and heuristics in mathematical programming (90C59) Computational methods for problems pertaining to convex and discrete geometry (52-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial-time algorithm, based on Newton's method, for linear programming
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• Linear Programming

This page was built for publication: Finite convergence into a convex polytope via facet reflections.