<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">606217088</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128101106.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150101xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s10598-014-9257-7</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s10598-014-9257-7</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Construction of Optimal Control Laws for a Model of Information Diffusion in a Social Group</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[S. Avvakumov, Yu. Kiselev]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">The article investigates a modified model of information propagation (diffusion). The model differs from the original model [2] by the choice of the optimized functional. The one-dimensional nonlinear optimal control problem is posed and solved by the Pontryagin maximum principle. It is shown that the optimal control is a relay function of time with at most one switching point. For some particular cases, the optimal-control switching point allows an explicit analytical description in terms of the problem parameters. In the general case, the optimal solution can be constructed by solving numerically the maximum-principle boundary-value problem. A one-dimensional convex minimization problem on a finite time interval (the planning horizon) is suggested for finding the optimal-control switching point. Easily verified condition on the problem parameters are given, guaranteeing the existence of the optimalcontrol switching point.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media New York, 2014</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">optimal control</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">information dissemination model</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Avvakumov</subfield>
   <subfield code="D">S.</subfield>
   <subfield code="u">Lomonosov Moscow State University, Faculty of Computation Mathematics and Cybernetics, Moscow, Russia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Kiselev</subfield>
   <subfield code="D">Yu</subfield>
   <subfield code="u">Lomonosov Moscow State University, Faculty of Computation Mathematics and Cybernetics, Moscow, Russia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Computational Mathematics and Modeling</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">26/1(2015-01-01), 61-86</subfield>
   <subfield code="x">1046-283X</subfield>
   <subfield code="q">26:1&lt;61</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">26</subfield>
   <subfield code="o">10598</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s10598-014-9257-7</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</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="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="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</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/s10598-014-9257-7</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">Avvakumov</subfield>
   <subfield code="D">S.</subfield>
   <subfield code="u">Lomonosov Moscow State University, Faculty of Computation Mathematics and Cybernetics, Moscow, Russia</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">Kiselev</subfield>
   <subfield code="D">Yu</subfield>
   <subfield code="u">Lomonosov Moscow State University, Faculty of Computation Mathematics and Cybernetics, Moscow, Russia</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 Mathematics and Modeling</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">26/1(2015-01-01), 61-86</subfield>
   <subfield code="x">1046-283X</subfield>
   <subfield code="q">26:1&lt;61</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">26</subfield>
   <subfield code="o">10598</subfield>
  </datafield>
 </record>
</collection>
