Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization

DOI10.3934/naco.2015.5.37zbMath1309.90048OpenAlexW2329164557MaRDI QIDQ2340161

Weiyi Qian, Si-Qi Li

Publication date: 16 April 2015

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2015.5.37

zbMATH Keywords

kernel functionlinear optimizationpolynomial complexityprimal-dual interior-point algorithm

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• A polynomial method of approximate centers for linear programming
• A new class of polynomial primal-dual methods for linear and semidefinite optimization
• A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
• A primal‐dual interior-point method for linear optimization based on a new proximity function
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• A polynomial-time algorithm for linear optimization based on a new simple kernel function
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization

This page was built for publication: Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization