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
| Autor: | Dussault, Jean-Pierre, Frappier, Mathieu, Gilbert, Jean Charles |
|---|---|
| Zdroj: | In EURO Journal on Computational Optimization December 2019 7(4):359-380 |
| Databáze: | ScienceDirect |
| Externí odkaz: |
|
Full text from SpringerLink