A MODIFIED FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION

DOI10.1142/S0217595913500279zbMath1401.90267OpenAlexW1977290122MaRDI QIDQ2873836

No author found.

Publication date: 27 January 2014

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595913500279

zbMATH Keywords

polynomial complexityinfeasible interior-point methodsfull-Newton step

Mathematics Subject Classification ID

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

Related Items (1)

A polynomial arc-search interior-point algorithm for linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• A full-Newton step interior-point algorithm based on modified Newton direction
• 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
• A primal-dual infeasible-interior-point algorithm for linear programming
• Polynomiality of infeasible-interior-point algorithms for linear programming
• Comparison of several numerical optimization methods
• 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 MODIFIED FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION