Crossmark

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

Crossref DOI link: https://doi.org/10.1007/s13675-019-00116-6

Published Print: 2019-12

Update policy: https://doi.org/10.1016/elsevier_cm_policy

Authors

Dussault, Jean-Pierre

Frappier, Mathieu

Gilbert, Jean Charles https://orcid.org/0000-0002-0375-4663
License Information

Text and Data Mining valid from 2019-12-01

Text and Data Mining valid from 2019-12-01
More Information

This article is maintained by: Elsevier

Article Title: 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

Journal Title: EURO Journal on Computational Optimization

CrossRef DOI link to publisher maintained version: https://doi.org/10.1007/s13675-019-00116-6

Content Type: article

Copyright: Copyright © 2019 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.

Document is current

Any future updates will be listed below