An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation

DOI10.1016/j.jmaa.2005.04.028zbMath1134.90541MaRDI QIDQ2581486

Shaohua Pan, Suyan He, Xing-Si Li

Publication date: 10 January 2006

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2005.04.028

zbMATH Keywords

Linear programming; Entropy function; Centering equation; Equivalent algebraic transformation; Logarithmic transformation

Mathematics Subject Classification ID

90C51: Interior-point methods

Related Items

Unnamed Item, Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function, A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function, New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP, A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step, A new primal-dual path-following interior-point algorithm for semidefinite optimization, Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier, A path following interior-point method for linear complementarity problems over circular cones, Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function, An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones

Cites Work

• A new polynomial-time algorithm for linear programming
• On the interplay among entropy, variable metrics and potential functions in interior-point algorithms
• Self-regular functions and new search directions for linear and semidefinite optimization
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item