Feasible region contraction interior point algorithm

DOI10.1016/J.AMC.2006.05.021MaRDI QIDQ858800zbMATH OpenOpenAlexFDO

Authors Ping-Qi Pan, Jian-Feng Hu, Chen Li

Publication date 11 January 2007

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2006.05.021

zbMATH Keywords

affine scaling algorithmbarrier functionfeasible region contractioninterior point algorithmlinear programmingnumerical examplesprimal path-following algorithmsteepest descent

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51)

Recommendations

• scientific article; zbMATH DE number 1300325
• A primal-dual infeasible-interior-point algorithm for linear programming
• Combining phase I and phase II in a potential reduction algorithm for linear programming
• Search for feasible solutions by interior point algorithms
• An interior point method for linear programming

Cites work

• A new polynomial-time algorithm for linear programming
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• scientific article; zbMATH DE number 3301975 (Why is no real title available?)
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories

Cited in

(2)

• Dual-primal algorithm for linear optimization
• scientific article; zbMATH DE number 6451396 (Why is no real title available?)

This page was built for publication: Feasible region contraction interior point algorithm

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