<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="C">   <ARLID>0461674</ARLID> <utime>20240111140922.8</utime><mtime>20160814235959.9</mtime>   <SCOPUS>84985972751</SCOPUS> <WOS>000390098702135</WOS>  <DOI>10.1109/ISIT.2016.7541771</DOI>           <title language="eng" primary="1">Convergence of generalized entropy minimizers in sequences of convex problems</title>  <specification> <page_count>5 s.</page_count> <media_type>E</media_type> </specification>   <serial><ARLID>cav_un_epca*0461768</ARLID><ISBN>978-1-5090-1806-2</ISBN><ISSN>2157-8117</ISSN><title>Proceedings of the 2016 IEEE International Symposium on Information Theory (ISIT 2016)</title><part_num/><part_title/><page_num>2609-2613</page_num><publisher><place>Piscataway</place><name>IEEE</name><year>2016</year></publisher></serial>    <keyword>entropy functional</keyword>   <keyword>convex constraints</keyword>   <keyword>Bregman divergence</keyword>   <keyword>f-divergence</keyword>   <keyword>Pyhtagorean theorem</keyword>    <author primary="1"> <ARLID>cav_un_auth*0101161</ARLID> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept language="eng">Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department language="eng">MTR</department> <full_dept>Department of Decision Making Theory</full_dept>  <name1>Matúš</name1> <name2>František</name2> <institution>UTIA-B</institution> <garant>K</garant> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0015571</ARLID> <name1>Csiszár</name1> <name2>I.</name2> <country>HU</country> </author>   <source> <source_type>pdf</source_type> <url>http://library.utia.cas.cz/separaty/2016/MTR/matus-0461674.pdf</url> </source>        <cas_special> <project> <ARLID>cav_un_auth*0332303</ARLID> <project_id>GA16-12010S</project_id> <agency>GA ČR</agency> <country>CZ</country> </project>  <abstract language="eng" primary="1">Integral functionals based on convex normal integrands are minimized over convex constraint sets. Generalized minimizers exist under a boundedness condition. Sequences of the minimization problems are studied when the constraint sets are nested. The corresponding sequences of generalized minimizers are related to the minimization over limit convex sets. Martingale theorems and moment problems are discussed.</abstract>    <action target="WRD"> <ARLID>cav_un_auth*0332302</ARLID> <name>IEEE International Symposium on Information Theory 2016</name> <dates>20160710</dates> <unknown tag="mrcbC20-s">20160715</unknown> <place>Barcelona</place> <country>ES</country>  </action>  <RIV>BA</RIV>    <reportyear>2017</reportyear>      <num_of_auth>2</num_of_auth>  <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0261349</permalink>   <confidential>S</confidential>  <unknown tag="mrcbC86"> 3+4 Proceedings Paper Computer Science Theory Methods|Engineering Electrical Electronic  </unknown>       <arlyear>2016</arlyear>       <unknown tag="mrcbU14"> 84985972751 SCOPUS </unknown> <unknown tag="mrcbU34"> 000390098702135 WOS </unknown> <unknown tag="mrcbU56"> pdf </unknown> <unknown tag="mrcbU63"> cav_un_epca*0461768 Proceedings of the 2016 IEEE International Symposium on Information Theory (ISIT 2016) 978-1-5090-1806-2 2157-8117 2609 2613 Piscataway IEEE 2016 </unknown> </cas_special> </bibitem>