BibTeX record journals/ejco/DussaultFG19

download as .bib file

@article{DBLP:journals/ejco/DussaultFG19,
  author       = {Jean{-}Pierre Dussault and
                  Mathieu Frappier and
                  Jean Charles 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},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {7},
  number       = {4},
  pages        = {359--380},
  year         = {2019},
  url          = {https://doi.org/10.1007/s13675-019-00116-6},
  doi          = {10.1007/S13675-019-00116-6},
  timestamp    = {Mon, 18 May 2020 12:42:57 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/DussaultFG19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.