<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">475750500</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180406123522.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170329e20001201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1023/A:1026546230851</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1023/A:1026546230851</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="2">
   <subfield code="a">A Global Linear and Local Quadratic Continuation Smoothing Method for Variational Inequalities with Box Constraints</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Bintong Chen, Xiaojun Chen]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In this paper, we propose a continuation method for box constrained variational inequality problems. The continuation method is based on the class of Gabriel-Moré smooth functions and has the following attractive features: It can start from any point; It has a simple and natural neighborhood definition; It solves only one approximate Newton equation at each iteration; It converges globally linearly and locally quadratically under nondegeneracy assumption at the solution point and other suitable assumptions. A hybrid method is also presented, which is shown to preserve the above convergence properties without the nondegeneracy assumption at the solution point. In particular, the hybrid method converges finitely for affine problems.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Kluwer Academic Publishers, 2000</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">variational inequality</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">continuation smoothing method</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">linear convergence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">quadratic convergence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Chen</subfield>
   <subfield code="D">Bintong</subfield>
   <subfield code="u">Department of Management and Decision Sciences, Washington State University, 99164-4736, Pullman, WA, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Chen</subfield>
   <subfield code="D">Xiaojun</subfield>
   <subfield code="u">Department of Mathematics and Computer Science, Shimane University, 690-8504, Matsue, Japan</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Computational Optimization and Applications</subfield>
   <subfield code="d">Kluwer Academic Publishers</subfield>
   <subfield code="g">17/2-3(2000-12-01), 131-158</subfield>
   <subfield code="x">0926-6003</subfield>
   <subfield code="q">17:2-3&lt;131</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">17</subfield>
   <subfield code="o">10589</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1023/A:1026546230851</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.1023/A:1026546230851</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">Chen</subfield>
   <subfield code="D">Bintong</subfield>
   <subfield code="u">Department of Management and Decision Sciences, Washington State University, 99164-4736, Pullman, WA, USA</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">Chen</subfield>
   <subfield code="D">Xiaojun</subfield>
   <subfield code="u">Department of Mathematics and Computer Science, Shimane University, 690-8504, Matsue, Japan</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">Computational Optimization and Applications</subfield>
   <subfield code="d">Kluwer Academic Publishers</subfield>
   <subfield code="g">17/2-3(2000-12-01), 131-158</subfield>
   <subfield code="x">0926-6003</subfield>
   <subfield code="q">17:2-3&lt;131</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">17</subfield>
   <subfield code="o">10589</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>
