Feasible region contraction interior point algorithm

DOI10.1016/j.amc.2006.05.021zbMath1107.65051OpenAlexW1973254679MaRDI QIDQ858800

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

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

linear programmingnumerical examplessteepest descentbarrier functioninterior point algorithmaffine scaling algorithmfeasible region contractionprimal path-following algorithm

Mathematics Subject Classification ID

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

Related Items (1)

Dual–primal algorithm for linear optimization

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• Boundary Behavior of Interior Point Algorithms in Linear Programming

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