The modified interior point algorithm for linear optimization

zbMATH Open1180.90189MaRDI QIDQ3393250FDOQ3393250

Authors: J. Saffar Ardabili, N. Aghayi 

Publication date: 19 August 2009

Recommendations

• Interior-point algorithm for linear optimization based on a new search direction
• A new and efficient large-update interior-point method for linear optimization
• New method for determining search directions for interior-point algorithms in linear optimization
• A full-Newton step interior-point algorithm based on modified Newton direction
• A Low Complexity Interior-Point Algorithm for Linear Programming

zbMATH Keywords

linear programminginterior point methodsNewton's methodcentral pathpath-followingsearch-direction

Mathematics Subject Classification ID

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

Cited In (9)

• A polynomial-time weighted path-following interior-point algorithm for linear optimization
• An interior-point algorithm for solving inverse linear optimization problem
• New method for determining search directions for interior-point algorithms in linear optimization
• An extension for identifying search directions for interior-point methods in linear optimization
• A new algorithm for solving self-dual linear optimization problems
• A new and efficient large-update interior-point method for linear optimization
• New interior point algorithms in linear programming
• Primal-dual entropy-based interior-point algorithms for linear optimization
• Interior-point algorithm for linear optimization based on a new search direction

This page was built for publication: The modified 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 Q3393250)