Polynomial worst-case iteration complexity of quasi-Newton primal-dual interior point algorithms for linear programming.
Saved in:
| 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.
Login for full access.
|
|
Be the first to leave a comment!
