An interior-point algorithm for linear programming with optimal selection of centering parameter and step size

DOI10.1007/s40305-020-00312-xzbMath1488.90120arXiv1304.3677OpenAlexW3048270612MaRDI QIDQ2059175

Ya-Guang Yang

Publication date: 13 December 2021

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.3677

zbMATH Keywords

convergencelinear programminginterior-point methodpolynomial algorithm

Mathematics Subject Classification ID

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

Related Items (1)

A polynomial time infeasible interior-point arc-search algorithm for convex optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial arc-search interior-point algorithm for linear programming
• A polynomial arc-search interior-point algorithm for convex quadratic programming
• Computational experience with a primal-dual interior point method for linear programming
• Linear and nonlinear programming.
• Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
• A primal-dual infeasible-interior-point algorithm for linear programming
• The many facets of linear programming
• Algorithm 915, SuiteSparseQR
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
• On Mehrotra-Type Predictor-Corrector Algorithms
• On the Implementation of a Primal-Dual Interior Point Method
• Numerical Optimization
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization

This page was built for publication: An interior-point algorithm for linear programming with optimal selection of centering parameter and step size