<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">378854275</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180305123331.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">161128e20031201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1515/156939403770888255</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)gruyter-10.1515/156939403770888255</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Serovajsky</subfield>
   <subfield code="D">S. Ya</subfield>
   <subfield code="u">Al-Farabi Kazakh National University, al-Farabi ave., 71, Almaty, 480078, Kazakhstan. E-mail: serovajskys@mail.ru</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Sequential extension in the problem of control in coefficients for elliptic-type equations</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[S. Ya. Serovajsky]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">The problem of control in coefficients for the elliptic-type equation is considered. For this problem, set by Lions [1], it is not too difficult a matter to obtain necessary optimality conditions under the assumption that the optimal control does exist; yet, solvability of this problem is hard to establish. Nonetheless, it makes sense to search for an admissible control such that the value of the functional calculated on this control is as close as is wished to its lower bound. In this paper, a method for finding minimizing sequences is proposed. The approach used is based on sequential extension of the problem which is analogous to the scheme of complement of spaces [2]. For the extended problem, necessary conditions for sequential optimum property, which characterize minimizing sequences, are established. With the example of Varga [3], we show that, following this method, one can find the minimizing sequences even if the optimal control does not exist.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Copyright 2003, Walter de Gruyter</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Journal of Inverse and Ill-posed Problems</subfield>
   <subfield code="d">Walter de Gruyter</subfield>
   <subfield code="g">11/5(2003-12-01), 523-536</subfield>
   <subfield code="x">0928-0219</subfield>
   <subfield code="q">11:5&lt;523</subfield>
   <subfield code="1">2003</subfield>
   <subfield code="2">11</subfield>
   <subfield code="o">jiip</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1515/156939403770888255</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/156939403770888255</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">Serovajsky</subfield>
   <subfield code="D">S. Ya</subfield>
   <subfield code="u">Al-Farabi Kazakh National University, al-Farabi ave., 71, Almaty, 480078, Kazakhstan. E-mail: serovajskys@mail.ru</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 Inverse and Ill-posed Problems</subfield>
   <subfield code="d">Walter de Gruyter</subfield>
   <subfield code="g">11/5(2003-12-01), 523-536</subfield>
   <subfield code="x">0928-0219</subfield>
   <subfield code="q">11:5&lt;523</subfield>
   <subfield code="1">2003</subfield>
   <subfield code="2">11</subfield>
   <subfield code="o">jiip</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>
