liu.seSearch for publications in DiVA

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

Dimensionality reduction and volume minimization - generalization of the determinant minimization criterion for reduced rank regression problemsPrimeFaces.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();
}
}
2006 (English)In: Linear Algebra and its Applications, ISSN 0024-3795, Vol. 418, no 1, p. 201-214Article in journal (Refereed) Published
##### Abstract [en]

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

2006. Vol. 418, no 1, p. 201-214
##### Keywords [en]

Volume; Minimization criterion; Determinant; Rank deficient matrix
##### National Category

Mathematics
##### Identifiers

URN: urn:nbn:se:liu:diva-13190DOI: 10.1016/j.laa.2006.01.032OAI: oai:DiVA.org:liu-13190DiVA, id: diva2:18006
#####

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

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

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt1178",{id:"formSmash:j_idt1178",widgetVar:"widget_formSmash_j_idt1178",multiple:true}); Available from: 2008-04-29 Created: 2008-04-29 Last updated: 2013-11-06
##### In thesis

In this article we propose a generalization of the determinant minimization criterion. The problem of minimizing the determinant of a matrix expression has implicit assumptions that the objective matrix is always nonsingular. In case of singular objective matrix the determinant would be zero and the minimization problem would be meaningless. To be able to handle all possible cases we generalize the determinant criterion to *rank reduction and volume minimization* of the objective matrix. The generalized minimization criterion is used to solve the following ordinary reduced rank regression problem:

min_{rank(X)=k}det(*B*-*XA*)(*B*-*XA*)^{T},

where *A* and *B* are known and *X* is to be determined. This problem is often encountered in the system identification context.

1. Algorithms in data mining using matrix and tensor methods$(function(){PrimeFaces.cw("OverlayPanel","overlay18011",{id:"formSmash:j_idt1464:0:j_idt1468",widgetVar:"overlay18011",target:"formSmash:j_idt1464:0:parentLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

2. Algorithms in data mining: reduced rank regression and classification by tensor methods$(function(){PrimeFaces.cw("OverlayPanel","overlay251094",{id:"formSmash:j_idt1464:1:j_idt1468",widgetVar:"overlay251094",target:"formSmash:j_idt1464:1:parentLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

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

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