<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">378920731</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180305123604.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">161128e20041101xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1515/1569395042571292</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)gruyter-10.1515/1569395042571292</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Shi</subfield>
   <subfield code="D">Z.-J</subfield>
   <subfield code="u">College of Operations Research and Management, Qufu Normal University, Rizhao, Shandong276826, China and Institute of Computational Mathematics and Scientific/Engineering Computing,Academy of Mathematics and System Sciences, Chinese Academy of Sciences, P.O. Box 2719, Beijing100080, China</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Convergence of multi-step curve search method for unconstrained optimization</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Z.-J. Shi]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">A new multi-step curve search method for unconstrained minimization problems is proposed. The convergence of the algorithm is proved under some mild conditions. The linear convergence rate is also investigated when the objective function is uniformly convex. This method uses previous multi-step iterative information and curve search rule to generate new iterative points. Using more previous iterative information and curve search rule can make the new method converge more stably than traditional descent methods and be suitable to solve large scale problems.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Copyright 2004, Walter de Gruyter</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">unconstrained optimization</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">multi-step</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">curve search method</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">convergence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Journal of Numerical Mathematics</subfield>
   <subfield code="d">Walter de Gruyter</subfield>
   <subfield code="g">12/4(2004-11-01), 297-309</subfield>
   <subfield code="x">1570-2820</subfield>
   <subfield code="q">12:4&lt;297</subfield>
   <subfield code="1">2004</subfield>
   <subfield code="2">12</subfield>
   <subfield code="o">jnma</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1515/1569395042571292</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.1515/1569395042571292</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">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Shi</subfield>
   <subfield code="D">Z.-J</subfield>
   <subfield code="u">College of Operations Research and Management, Qufu Normal University, Rizhao, Shandong276826, China and Institute of Computational Mathematics and Scientific/Engineering Computing,Academy of Mathematics and System Sciences, Chinese Academy of Sciences, P.O. Box 2719, Beijing100080, China</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">Journal of Numerical Mathematics</subfield>
   <subfield code="d">Walter de Gruyter</subfield>
   <subfield code="g">12/4(2004-11-01), 297-309</subfield>
   <subfield code="x">1570-2820</subfield>
   <subfield code="q">12:4&lt;297</subfield>
   <subfield code="1">2004</subfield>
   <subfield code="2">12</subfield>
   <subfield code="o">jnma</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="b">CC0</subfield>
   <subfield code="u">http://creativecommons.org/publicdomain/zero/1.0</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-gruyter</subfield>
  </datafield>
 </record>
</collection>
