Number of the records: 1  

Generalized minimizers of convex integral functionals, Bregman distance, Pythagorean identities

  1. 1.
    SYSNO ASEP0381750
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleGeneralized minimizers of convex integral functionals, Bregman distance, Pythagorean identities
    Author(s) Csiszár, I. (HU)
    Matúš, František (UTIA-B) RID
    Number of authors2
    Source TitleKybernetika. - : Ústav teorie informace a automatizace AV ČR, v. v. i. - ISSN 0023-5954
    Roč. 48, č. 4 (2012), s. 637-689
    Number of pages53 s.
    Languageeng - English
    CountryCZ - Czech Republic
    Keywordsmaximum entropy ; moment constraint ; generalized primal/dual solutions ; normal integrand ; convex duality ; Bregman projection ; inference principles
    Subject RIVBA - General Mathematics
    R&D ProjectsGA201/08/0539 GA ČR - Czech Science Foundation (CSF)
    GAP202/10/0618 GA ČR - Czech Science Foundation (CSF)
    Institutional supportUTIA-B - RVO:67985556
    UT WOS000310190200004
    EID SCOPUS84866016929
    AnnotationIntegral functionals based on convex normal integrands are minimized subject to finitely many moment constraints. The integrands are finite on the positive and infinite on the negative numbers, strictly convex but not necessarily differentiable. The minimization is viewed as a primal problem and studied together with a dual one in the framework of convex duality. The effective domain of the value function is described by a conic core, a modification of the earlier concept of convex core. Minimizers and generalized minimizers are explicitly constructed from solutions of modified dual problems, not assuming the primal constraint qualification. A-generalized Pythagorean identity is presented using Bregman distance and a correction term for lack of essential smoothness in integrands. Results are applied to minimization of Bregman distances. Existence of a generalized dual solution is established whenever the dual value is finite, assuming the dual constraint qualification. Examples of "irregular" situations are included, pointing to the limitations of generality of certain key results.
    WorkplaceInstitute of Information Theory and Automation
    ContactMarkéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201.
    Year of Publishing2013
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.