<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="C">   <ARLID>0397249</ARLID> <utime>20240103203059.2</utime><mtime>20131112235959.9</mtime>    <DOI>10.1007/978-3-642-40020-9_32</DOI>           <title language="eng" primary="1">Generalized minimizers of convex integral functionals and Pythagorean identities</title>  <specification> <page_count>6 s.</page_count> <media_type>P</media_type> </specification>    <serial><ARLID>cav_un_epca*0398425</ARLID><ISBN>978-3-642-40019-3</ISBN><ISSN>0302-9743</ISSN><title>Geometric Science of Information 2013</title><part_num/><part_title/><page_num>302-307</page_num><publisher><place>Berlin</place><name>Springer</name><year>2013</year></publisher></serial>    <keyword>Integral functional</keyword>   <keyword>convex normal integrand</keyword>   <keyword>primal constraint qualification</keyword>   <keyword>generalized minimizer</keyword>   <keyword>Pythagorean identities</keyword>   <keyword>information geometry</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/2013/MTR/http://library.utia.cas.cz/separaty/2013/MTR/matus-0397249.pdf</url> </source>        <cas_special>  <abstract language="eng" primary="1">Integral functionals based on convex normal integrands are minimized subject to finitely many moment constraints. The effective domain of the value function is described by a modification of the concept of convex core. The minimization is viewed as a primal problem and studied together with a dual one in the framework of convex duality. The minimizers and generalized minimizers are explicitly described whenever the primal value is finite, assuming a dual constraint qualification but not the primal constraint qualification. A generalized Pythagorean identity is presented using Bregman distance and a correction term.</abstract>  <action target="WRD"> <ARLID>cav_un_auth*0294821</ARLID> <name>Geometric Science of Information 2013</name> <place>Paris</place> <dates>28.08.2013-30.08.2013</dates>  <country>FR</country> </action>    <reportyear>2014</reportyear>  <RIV>BD</RIV>      <num_of_auth>2</num_of_auth>  <presentation_type> PR </presentation_type> <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0225900</permalink>         <unknown tag="mrcbT16-q">100</unknown> <unknown tag="mrcbT16-s">0.325</unknown> <unknown tag="mrcbT16-y">16.75</unknown> <unknown tag="mrcbT16-x">0.51</unknown> <unknown tag="mrcbT16-4">Q2</unknown> <unknown tag="mrcbT16-E">Q3</unknown> <arlyear>2013</arlyear>       <unknown tag="mrcbU63"> cav_un_epca*0398425 Geometric Science of Information 2013 978-3-642-40019-3 0302-9743 302 307 Berlin Springer 2013 Lecture Notes in Computer Science 8085 </unknown> </cas_special> </bibitem>