@article{journals/ejco/DussaultFG19,
  added-at = {2020-05-18T00:00:00.000+0200},
  author = {Dussault, Jean-Pierre and Frappier, Mathieu and Gilbert, Jean Charles},
  biburl = {https://www.bibsonomy.org/bibtex/26ff6e44aee7783270e72091f7233831f/dblp},
  ee = {https://doi.org/10.1007/s13675-019-00116-6},
  interhash = {041fc6fd72f4665c2ffaf29a10c3fdfb},
  intrahash = {6ff6e44aee7783270e72091f7233831f},
  journal = {EURO J. Comput. Optim.},
  keywords = {dblp},
  number = 4,
  pages = {359-380},
  timestamp = {2020-05-19T11:48:19.000+0200},
  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.},
  url = {http://dblp.uni-trier.de/db/journals/ejco/ejco7.html#DussaultFG19},
  volume = 7,
  year = 2019
}

{"_id":"RG5dmvNsYEd4mKdEi","bibbaseid":"dussault-frappier-gilbert-alowerboundontheiterativecomplexityoftheharkerandpangglobalizationtechniqueofthenewtonminalgorithmforsolvingthelinearcomplementarityproblem-2019","author_short":["Dussault, J.","Frappier, M.","Gilbert, J. C."],"bibdata":{"bibtype":"article","type":"article","added-at":"2020-05-18T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Dussault"],"firstnames":["Jean-Pierre"],"suffixes":[]},{"propositions":[],"lastnames":["Frappier"],"firstnames":["Mathieu"],"suffixes":[]},{"propositions":[],"lastnames":["Gilbert"],"firstnames":["Jean","Charles"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/26ff6e44aee7783270e72091f7233831f/dblp","ee":"https://doi.org/10.1007/s13675-019-00116-6","interhash":"041fc6fd72f4665c2ffaf29a10c3fdfb","intrahash":"6ff6e44aee7783270e72091f7233831f","journal":"EURO J. Comput. Optim.","keywords":"dblp","number":"4","pages":"359-380","timestamp":"2020-05-19T11:48:19.000+0200","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.","url":"http://dblp.uni-trier.de/db/journals/ejco/ejco7.html#DussaultFG19","volume":"7","year":"2019","bibtex":"@article{journals/ejco/DussaultFG19,\n added-at = {2020-05-18T00:00:00.000+0200},\n author = {Dussault, Jean-Pierre and Frappier, Mathieu and Gilbert, Jean Charles},\n biburl = {https://www.bibsonomy.org/bibtex/26ff6e44aee7783270e72091f7233831f/dblp},\n ee = {https://doi.org/10.1007/s13675-019-00116-6},\n interhash = {041fc6fd72f4665c2ffaf29a10c3fdfb},\n intrahash = {6ff6e44aee7783270e72091f7233831f},\n journal = {EURO J. Comput. Optim.},\n keywords = {dblp},\n number = 4,\n pages = {359-380},\n timestamp = {2020-05-19T11:48:19.000+0200},\n 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.},\n url = {http://dblp.uni-trier.de/db/journals/ejco/ejco7.html#DussaultFG19},\n volume = 7,\n year = 2019\n}\n\n","author_short":["Dussault, J.","Frappier, M.","Gilbert, J. C."],"key":"journals/ejco/DussaultFG19","id":"journals/ejco/DussaultFG19","bibbaseid":"dussault-frappier-gilbert-alowerboundontheiterativecomplexityoftheharkerandpangglobalizationtechniqueofthenewtonminalgorithmforsolvingthelinearcomplementarityproblem-2019","role":"author","urls":{"Link":"https://doi.org/10.1007/s13675-019-00116-6","Paper":"http://dblp.uni-trier.de/db/journals/ejco/ejco7.html#DussaultFG19"},"keyword":["dblp"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/gilbert?items=1000","dataSources":["KeJ3EHFpWxHWZPCgC"],"keywords":["dblp"],"search_terms":["lower","bound","iterative","complexity","harker","pang","globalization","technique","newton","min","algorithm","solving","linear","complementarity","problem","dussault","frappier","gilbert"],"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.","year":2019}