Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A lower bound on the iterative complexity of the Harker and Pang ..."

Jean-Pierre Dussault, Mathieu Frappier, Jean Charles Gilbert (2019)

> Home

Details and statistics

DOI: 10.1007/S13675-019-00116-6

access: closed

type: Journal Article

metadata version: 2020-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ejco/DussaultFG19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejco/DussaultFG19
Jean-Pierre Dussault, Mathieu Frappier, Jean Charles Gilbert:
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. EURO J. Comput. Optim. 7(4): 359-380 (2019)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.