scientific article; zbMATH DE number 1300325

MaRDI QIDQ4248871zbMATH OpenFDO

Authors Kunping Zhou, Xinxin Hu, Xu Meng

Publication date 29 November 1999

zbMATH Keywords

infeasible-interior-point algorithm\(\varepsilon\)-complementarity\(\varepsilon\)-feasibilitypath-tracing

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming
• A new infeasible interior-point algorithm for linear complementarity problem
• A primal-dual infeasible-interior-point algorithm for linear programming
• An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
• Polynomiality of infeasible-interior-point algorithms for linear programming

Cited in

(7)

• Feasible region contraction interior point algorithm
• A numerical study of an infeasible primal-dual path-following algorithm for linear programming
• Following a “Balanced” Trajectory from an Infeasible Point to an Optimal Linear Programming Solution with a Polynomial-Time Algorithm
• Infeasible/feasible search trajectories and directional rounding in integer programming
• Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming
• An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
• A full-Newton step infeasible interior-point algorithm for linear programming based on a self-regular proximity

This page was built for publication:

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