A polynomial-time weighted path-following interior-point algorithm for linear optimization

DOI10.1142/S1793557120500382MaRDI QIDQ5221008zbMATH OpenOpenAlexWikidataFDO

Authors Mohamed Achache

Publication date 27 March 2020

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

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

zbMATH Keywords

interior-point methodscomplexity of algorithmsshort-step primal-dual algorithmslinear optimization problems

Mathematics Subject Classification ID

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

Recommendations

• A weighted-path-following method for linear optimization
• Weighted-path-following algorithm for linear programming
• A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization
• Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem
• The modified interior point algorithm for linear optimization

Cites work

• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 1131479 (Why is no real title available?)
• scientific article; zbMATH DE number 4183197 (Why is no real title available?)
• A full-step interior-point algorithm for linear complementarity problem based on a simple function
• A new primal-dual path-following method for convex quadratic programming
• A weighted-path-following method for linear optimization
• A weighted-path-following method for monotone horizontal linear complementarity problem
• A weighted-path-following method for the linear complementarity problem
• Primal-dual target-following algorithms for linear programming

Cited in

(4)

• The solution of the absolute value equations using two generalized accelerated overrelaxation methods
• A weighted-path-following method for linear optimization
• A polynomial path-following interior point algorithm for general linear complementarity problems
• Weighted-path-following algorithm for linear programming

This page was built for publication: A polynomial-time weighted path-following 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 Q5221008)