Extended Newton’s Method With Applications To Interior Point Algorithms Of Mathematical Programming∗
| dc.contributor.author | Regmi, S. | |
| dc.contributor.author | Argyros, C.I. | |
| dc.contributor.author | Argyros, I.K. | |
| dc.contributor.author | George, S. | |
| dc.date.accessioned | 2026-02-04T12:28:27Z | |
| dc.date.issued | 2022 | |
| dc.description.abstract | We use a weaker Newton—Kantorovich theorem for solving equations, introduced in [3] to analyze interior point methods. This way our approach extends earlier works in [6] on Newton’s method and interior point algorithms. © 2022, Tsing Hua University. All rights reserved. | |
| dc.identifier.citation | Applied Mathematics E - Notes, 2022, 22, , pp. 273-280 | |
| dc.identifier.issn | 16072510 | |
| dc.identifier.uri | https://idr.nitk.ac.in/handle/123456789/22759 | |
| dc.publisher | Tsing Hua University | |
| dc.title | Extended Newton’s Method With Applications To Interior Point Algorithms Of Mathematical Programming∗ |
