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

DOI10.1007/S10957-013-0281-0MaRDI QIDQ6826455zbMATH OpenFDO

Authors Ya-Guang Yang

Publication date 11 November 2013

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10957-013-0281-0

zbMATH Keywords

linear programmingpolynomial algorithmarc-searchinterior-point method

Mathematics Subject Classification ID

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

Cited in

(1)

• An arc-search interior-point algorithm for nonlinear constrained optimization

This page was built for publication: A polynomial arc-search interior-point algorithm for linear programming

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