CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_upper_j_idt155",{id:"formSmash:upper:j_idt155",widgetVar:"widget_formSmash_upper_j_idt155",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:upper:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt156_j_idt158",{id:"formSmash:upper:j_idt156:j_idt158",widgetVar:"widget_formSmash_upper_j_idt156_j_idt158",target:"formSmash:upper:j_idt156:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Optimal Decomposition in Real Interpolation and Duality in Convex AnalysisPrimeFaces.cw("AccordionPanel","widget_formSmash_some",{id:"formSmash:some",widgetVar:"widget_formSmash_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_all",{id:"formSmash:all",widgetVar:"widget_formSmash_all",multiple:true});
function selectAll()
{
var panelSome = $(PrimeFaces.escapeClientId("formSmash:some"));
var panelAll = $(PrimeFaces.escapeClientId("formSmash:all"));
panelAll.toggle();
toggleList(panelSome.get(0).childNodes, panelAll);
toggleList(panelAll.get(0).childNodes, panelAll);
}
/*Toggling the list of authorPanel nodes according to the toggling of the closeable second panel */
function toggleList(childList, panel)
{
var panelWasOpen = (panel.get(0).style.display == 'none');
// console.log('panel was open ' + panelWasOpen);
for (var c = 0; c < childList.length; c++) {
if (childList[c].classList.contains('authorPanel')) {
clickNode(panelWasOpen, childList[c]);
}
}
}
/*nodes have styleClass ui-corner-top if they are expanded and ui-corner-all if they are collapsed */
function clickNode(collapse, child)
{
if (collapse && child.classList.contains('ui-corner-top')) {
// console.log('collapse');
child.click();
}
if (!collapse && child.classList.contains('ui-corner-all')) {
// console.log('expand');
child.click();
}
}
PrimeFaces.cw("AccordionPanel","widget_formSmash_responsibleOrgs",{id:"formSmash:responsibleOrgs",widgetVar:"widget_formSmash_responsibleOrgs",multiple:true}); 2013 (English)Licentiate thesis, monograph (Other academic)
##### Abstract [en]

##### Place, publisher, year, edition, pages

Linköping: Linköping University Electronic Press, 2013. , 100 p.
##### Series

Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1604
##### National Category

Mathematics
##### Identifiers

URN: urn:nbn:se:liu:diva-94506Local ID: LIU-TEK-LIC-2013:38ISBN: 978-91-7519-573-5 (print)OAI: oai:DiVA.org:liu-94506DiVA: diva2:632532
##### Presentation

2013-09-05, Allan Turing, Hus B, Campus Valla, Linköpings universitet, Linköping, 10:00 (English)
##### Opponent

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt452",{id:"formSmash:j_idt452",widgetVar:"widget_formSmash_j_idt452",multiple:true});
##### Supervisors

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt458",{id:"formSmash:j_idt458",widgetVar:"widget_formSmash_j_idt458",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt464",{id:"formSmash:j_idt464",widgetVar:"widget_formSmash_j_idt464",multiple:true});
Available from: 2013-06-25 Created: 2013-06-25 Last updated: 2013-09-10Bibliographically approved

This thesis is devoted to the study of mathematical properties of exact minimizers for the K–,L–, and E– functionals of the theory of real interpolation. Recently exact minimizers for these functionals have appeared in important results in image processing.

In the thesis, we present a geometry of optimal decomposition for L– functional for the couple (ℓ^{2}, X), where space ℓ^{2} is defined by the standard Euclidean norm ǁ · ǁ_{2} and where X is a Banach space on R^{n}. The well known ROF denoising model is a special case of an L– functional for the couple (L^{2}, BV) where L^{2} and BV stand for the space of square integrable functions and the space of functions with bounded variation on a rectangular domain respectively. We provide simple proofs and geometrical interpretation of optimal decomposition by following ideas by Yves Meyer who has used a duality approach to characterize optimal decomposition for ROF denoising model.

The operation of infimal convolution is a very important and non–trivial tool in functional analysis and is also very well–known within the context of convex analysis. The L–, K– and E– functionals can be regarded as an infimal convolution of two well defined functions but unfortunately tools from convex analysis can not be applied in a straigtforward way in this context of couples of spaces. We have considered infimal convolution on Banach couples and by using a theorem due to Attouch and Brezis, we have established sufficient conditions for an infimal convolution on a given Banach couple to be subdifferentiable, which turns out to be the most important requirement that an infimal convolution would satisfy for a decomposition to be optimal. We have also provided a lemma that we have named Key Lemma, which characterizes optimal decomposition for an infimal convolution in general.

The main results concerning mathematical properties of optimal decomposition for L–, K– and E– functionals for the case of general regular Banach couples are presented. We use a duality approach which can be summarized in three steps: First we consider the concerned functional as an infimal convolution and reformulate the infimal convolution at hand as a minimization of a sum of two specific functions on the intersection of the couple. Then we prove that it is subdifferentiable and finally use the characterizaton of its optimal decomposition.

We have also investigated how powerful our approach is by applying it to two well–known optimization problems, namely convex and linear programming. As a result we have obtained new proofs for duality theorems which are central for these problems.

isbn
urn-nbn$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_j_idt1176",{id:"formSmash:j_idt1176",widgetVar:"widget_formSmash_j_idt1176",showEffect:"fade",hideEffect:"fade",showDelay:500,hideDelay:300,target:"formSmash:altmetricDiv"});});

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_lower_j_idt1234",{id:"formSmash:lower:j_idt1234",widgetVar:"widget_formSmash_lower_j_idt1234",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:lower:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1236_j_idt1238",{id:"formSmash:lower:j_idt1236:j_idt1238",widgetVar:"widget_formSmash_lower_j_idt1236_j_idt1238",target:"formSmash:lower:j_idt1236:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});