A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem
Jean-Pierre Dussault, Mathieu Frappier, Jean Charles Gilbert
| Year of publication: |
2019
|
|---|---|
| Authors: | Dussault, Jean-Pierre ; Frappier, Mathieu ; Gilbert, Jean Charles |
| Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 7.2019, 4, p. 359-380
|
| Subject: | Iterative complexity | Linear complementarity problem | Fathi and Murty problems | Globalization | Harker and Pang algorithm | Line search | Newton-min algorithm | Nondegenerate matrix | P-matrix | Semismooth Newton method | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1007/s13675-019-00116-6 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012314123