NEWTON FLOW AND INTERIOR POINT METHODS IN LINEAR PROGRAMMING

DOI10.1142/S0218127405012363zbMath1079.90156OpenAlexW1973659154MaRDI QIDQ5318371

Michael Shub, Jean-Pierre Dedieu

Publication date: 26 September 2005

Published in: International Journal of Bifurcation and Chaos (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218127405012363

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51) Dynamical systems in optimization and economics (37N40)

Related Items (4)

Log-Barrier Interior Point Methods Are Not Strongly Polynomial ⋮ Polytopes and arrangements: diameter and curvature ⋮ What Tropical Geometry Tells Us about the Complexity of Linear Programming ⋮ Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes

Cites Work

• Karmarkar's linear programming algorithm and Newton's method
• A Mathematical View of Interior-Point Methods in Convex Optimization
• Boundary Behavior of Interior Point Algorithms in Linear Programming

This page was built for publication: NEWTON FLOW AND INTERIOR POINT METHODS IN LINEAR PROGRAMMING