View in EDS HTML Full Text PDF Full Text

Polynomial worst-case iteration complexity of quasi-Newton primal-dual interior point algorithms for linear programming.

Saved in:
Bibliographic Details
Title: Polynomial worst-case iteration complexity of quasi-Newton primal-dual interior point algorithms for linear programming.
Authors: Gondzio, Jacek1, J.Gondzio@ed.ac.uk, Sobral, Francisco N. C.2, fncsobral@uem.br
Source: Computational Optimization & Applications; Jun2025, Vol. 91 Issue 2, p649-681, 33p
Database: Applied Science & Technology Source
Full text is not displayed to guests.
Description
ISSN:09266003
DOI:10.1007/s10589-024-00584-6