A new infeasible interior-point algorithm with full step for linear optimization based on a simple function

DOI10.1080/00207160.2011.597503zbMath1266.90125OpenAlexW1988885072MaRDI QIDQ2885543

Lipu Zhang, Yinghong Xu

Publication date: 23 May 2012

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2011.597503

zbMATH Keywords

linear optimizationcomplexity analysisinfeasible interior-point algorithmfull step

Mathematics Subject Classification ID

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

Related Items (4)

A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function ⋮ A full-modified-Newton step infeasible interior-point algorithm for linear optimization ⋮ Simplified infeasible interior-point algorithm for linear optimization based on a simple function ⋮ Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
• Feasibility issues in a primal-dual interior-point method for linear programming
• A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
• Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization
• On quadratic convergence of the \(O(\sqrt nL)\)-iteration homogeneous and self-dual linear programming algorithm
• A primal-dual infeasible-interior-point algorithm for linear programming
• Polynomiality of infeasible-interior-point algorithms for linear programming
• Self-regular functions and new search directions for linear and semidefinite optimization
• The complexity of self-regular proximity based infeasible IPMs
• 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 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 Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• New complexity analysis of the primal-dual Newton method for linear optimization

This page was built for publication: A new infeasible interior-point algorithm with full step for linear optimization based on a simple function