A modified full-Newton step infeasible interior-point algorithm for linear optimization

DOI10.1142/S0217595913500279MaRDI QIDQ2873836zbMATH OpenOpenAlexFDO

Authors Behrouz Kheirfam, K. Ahmadi, F. Hasani

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

full-Newton stepinfeasible interior-point methodspolynomial complexity

Mathematics Subject Classification ID

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

Recommendations

• A full-modified-Newton step infeasible interior-point algorithm for linear optimization
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• A full-Newton step infeasible interior-point method based on a new search direction
• An infeasible interior-point algorithm with full-Newton step for linear optimization
• An improved infeasible interior-point method with full-Newton step for linear optimization

Cites work

• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
• A full-Newton step interior-point algorithm based on modified Newton direction
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• A primal-dual infeasible-interior-point algorithm for linear programming
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• Comparison of several numerical optimization methods
• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 3286662 (Why is no real title available?)
• Improved full-Newton step O(nL) infeasible interior-point method for linear optimization
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Polynomiality of infeasible-interior-point algorithms for linear programming

Cited in

(14)

• A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
• A full-modified-Newton step O(n) infeasible interior-point method for the special weighted linear complementarity problem
• An infeasible interior-point algorithm with full-Newton step for linear optimization
• A full-modified-Newton step infeasible interior-point algorithm for linear optimization
• A new feasible interior-point algorithm with full step for linear optimization based on a simple function
• AN ADAPTIVE PRIMAL-DUAL FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION
• A full-Newton step infeasible interior-point algorithm for linear programming based on a self-regular proximity
• A full-Newton step interior-point algorithm based on modified Newton direction
• A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization
• A full-Newton step infeasible interior-point method based on a new search direction
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• scientific article; zbMATH DE number 6401300 (Why is no real title available?)
• Interior-point algorithm for linear programming based on a new descent direction
• Implementation of infeasible interior-point methods based on a new search direction

This page was built for publication: A modified full-Newton step infeasible interior-point algorithm for linear optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2873836)