A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION BASED ON AN EXPONENTIAL KERNEL FUNCTION

DOI10.1142/S1793557114500181zbMath1291.90130MaRDI QIDQ5417513

F. Hasani, Behrouz Kheirfam

Publication date: 21 May 2014

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

kernel functionpolynomial complexityinfeasible interior-point methodfull-Newton step

Mathematics Subject Classification ID

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

Cites Work

• A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• A primal-dual infeasible-interior-point algorithm for linear programming
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
• A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization

This page was built for publication: A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION BASED ON AN EXPONENTIAL KERNEL FUNCTION