<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     naa a22        4500</leader>
  <controlfield tag="001">510809103</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180411083433.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">180411e20130601xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s12532-012-0050-3</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s12532-012-0050-3</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Trajectory-following methods for large-scale degenerate convex quadratic programming</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Nicholas Gould, Dominique Orban, Daniel Robinson]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">We consider a class of infeasible, path-following methods for convex quadratric programming. Our methods are designed to be effective for solving both nondegerate and degenerate problems, where degeneracy is understood to mean the failure of strict complementarity at a solution. Global convergence and a polynomial bound on the number of iterations required is given. An implementation, CQP, is available as part of GALAHAD. We illustrate the advantages of our approach on the CUTEr and Maros-Meszaros test sets.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Crown Copyright, 2013</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Convex quadratic programming</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Path-following methods</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Degenerate problems</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Software</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Gould</subfield>
   <subfield code="D">Nicholas</subfield>
   <subfield code="u">Scientific Computing Department, Rutherford Appleton Laboratory, Chilton, OX11 0QX, Oxfordshire, UK</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Orban</subfield>
   <subfield code="D">Dominique</subfield>
   <subfield code="u">GERAD and Mathematics and Industrial Engineering Department, École Polytechnique de Montréal, C. P. 6079, Succ. Centre Ville, H3C 3A7, Montreal, QC, Canada</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Robinson</subfield>
   <subfield code="D">Daniel</subfield>
   <subfield code="u">Department of Applied Mathematics and Statistics, Johns Hopkins University, 100 Whitehead Hall, 3400 N. Charles Street, 21218, Baltimore, MD, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Mathematical Programming Computation</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">5/2(2013-06-01), 113-142</subfield>
   <subfield code="x">1867-2949</subfield>
   <subfield code="q">5:2&lt;113</subfield>
   <subfield code="1">2013</subfield>
   <subfield code="2">5</subfield>
   <subfield code="o">12532</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s12532-012-0050-3</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s12532-012-0050-3</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Gould</subfield>
   <subfield code="D">Nicholas</subfield>
   <subfield code="u">Scientific Computing Department, Rutherford Appleton Laboratory, Chilton, OX11 0QX, Oxfordshire, UK</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Orban</subfield>
   <subfield code="D">Dominique</subfield>
   <subfield code="u">GERAD and Mathematics and Industrial Engineering Department, École Polytechnique de Montréal, C. P. 6079, Succ. Centre Ville, H3C 3A7, Montreal, QC, Canada</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Robinson</subfield>
   <subfield code="D">Daniel</subfield>
   <subfield code="u">Department of Applied Mathematics and Statistics, Johns Hopkins University, 100 Whitehead Hall, 3400 N. Charles Street, 21218, Baltimore, MD, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Mathematical Programming Computation</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">5/2(2013-06-01), 113-142</subfield>
   <subfield code="x">1867-2949</subfield>
   <subfield code="q">5:2&lt;113</subfield>
   <subfield code="1">2013</subfield>
   <subfield code="2">5</subfield>
   <subfield code="o">12532</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
