NEWTON FLOW AND INTERIOR POINT METHODS IN LINEAR PROGRAMMING

DOI10.1142/S0218127405012363MaRDI QIDQ5318371zbMATH OpenOpenAlexFDO

Authors Michael Shub, Jean-Pierre Dedieu

Publication date 26 September 2005

Published in International Journal of Bifurcation and Chaos in Applied Sciences and Engineering (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Linear programming and the Newton barrier flow
• scientific article; zbMATH DE number 1120265
• scientific article; zbMATH DE number 4031392
• A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming
• A multiplicative barrier function method for linear programming

Cites work

• A mathematical view of interior-point methods in convex optimization
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• Karmarkar's linear programming algorithm and Newton's method

Cited in

(8)

• Numerical representations of a universal subspace flow for linear programs
• Linear programming and the Newton barrier flow
• Newtonian program analysis via tensor product
• Central path curvature and iteration-complexity for redundant Klee-Minty cubes
• Log-Barrier Interior Point Methods Are Not Strongly Polynomial
• What Tropical Geometry Tells Us about the Complexity of Linear Programming
• Zonotopes and the LP-Newton method
• Polytopes and arrangements: diameter and curvature

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5318371)