<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="C">   <ARLID>0356510</ARLID> <utime>20240103194845.7</utime><mtime>20110218235959.9</mtime>         <title language="eng" primary="1">On minimization of multivariate entropy functionals</title>  <specification> <page_count>5 s.</page_count> <media_type>WWW</media_type> </specification>   <serial><ARLID>cav_un_epca*0356677</ARLID><ISBN>978-1-4244-4535-6</ISBN><title>Proceedings of the 2009 IEEE Information Theory Workshop on Networking and Information</title><part_num/><part_title/><page_num>96-100</page_num><publisher><place>Volos</place><name>IEEE</name><year>2009</year></publisher></serial>    <keyword>convex integral functionals</keyword>   <keyword>entropy</keyword>   <keyword>f-divergence</keyword>   <keyword>Bregman distance</keyword>    <author primary="1"> <ARLID>cav_un_auth*0015571</ARLID> <name1>Csiszár</name1> <name2>I.</name2> <country>HU</country>  </author> <author primary="0"> <ARLID>cav_un_auth*0101161</ARLID> <name1>Matúš</name1> <name2>František</name2> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept>Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department>MTR</department> <institution>UTIA-B</institution> <full_dept>Department of Decision Making Theory</full_dept>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2011/MTR/matus-on minimization of multivariate entropy functionals.pdf</url> </source>        <cas_special> <project> <project_id>GA201/08/0539</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0239648</ARLID> </project> <project> <project_id>IAA100750603</project_id> <agency>GA AV ČR</agency> <ARLID>cav_un_auth*0216427</ARLID> </project> <research> <research_id>CEZ:AV0Z10750506</research_id> </research>  <abstract language="eng" primary="1">The problem of minimizing convex integral functionals subject to   moment-like constraints is treated in a general setting when the   underlying convex function may be multivariate, perhaps not   strictly convex or differentiable. The results are applied to the   minimization of $f$-divergences simultaneously in both variables.</abstract>  <action target="WRD"> <ARLID>cav_un_auth*0269965</ARLID> <name>IEEE Information Theory Workshop on Networking and Information Theory 2009</name> <place>Volos</place> <dates>10.06.2009-12.06.2009</dates>  <country>GR</country> </action>    <reportyear>2011</reportyear>  <RIV>BD</RIV>      <permalink>http://hdl.handle.net/11104/0195013</permalink>        <arlyear>2009</arlyear>       <unknown tag="mrcbU63"> cav_un_epca*0356677 Proceedings of the 2009 IEEE Information Theory Workshop on Networking and Information 978-1-4244-4535-6 96 100 Volos IEEE 2009 </unknown> </cas_special> </bibitem>