An adaptive-step primal-dual interior point algorithm for linear optimization

DOI10.1016/j.na.2009.05.021zbMath1239.90072OpenAlexW2077264651MaRDI QIDQ425813

J. Herrera, H. S. Yoon

Publication date: 9 June 2012

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2009.05.021

zbMATH Keywords

kernel functionpolynomial algorithmworst-case complexitylinear optimization problemprimal-dual interior point methodadaptive-steplarge-update

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Cites Work

• A new polynomial-time algorithm for linear programming
• Primal-dual target-following algorithms for linear programming
• On the Implementation of a Primal-Dual Interior Point Method
• A dynamic large-update primal‐dual interior-point method for linear optimization
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A self-adjusting primal–dual interior point method for linear programs
• An adaptive self-regular proximity-based large-update IPM for LO
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item