liu.seSearch for publications in DiVA

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

Structure Exploitation in Semidefinite Programming for ControlPrimeFaces.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}); 2010 (English)Licentiate thesis, comprehensive summary (Other academic)
##### Abstract [en]

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

Linköping: Linköping University , 2010. , 58 p.
##### Series

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

Control Engineering
##### Identifiers

URN: urn:nbn:se:liu:diva-98178Local ID: LiU-TEK-LIC-2010:1ISBN: 978-91-7393-441-1 (print)OAI: oai:DiVA.org:liu-98178DiVA: diva2:652429
#####

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

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

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt446",{id:"formSmash:j_idt446",widgetVar:"widget_formSmash_j_idt446",multiple:true});
Available from: 2013-10-09 Created: 2013-09-30 Last updated: 2013-10-09Bibliographically approved
##### List of papers

Many control problems can be cast as semideﬁnite programs. However, since the size of these problems grow quite quickly, the computational time to solve them can be quite substantial. In order to reduce the computational time, many proposals of how to tailormake algorithms to various types of control problems can be found in the literature. In this thesis, two papers with similar ambitions are presented.

The ﬁrst paper deals with the case where the constraints of the optimization problem are of the type that stems from the Kalman-Yakubovic-Popov lemma, and where some of these constraints are so called complicating constraints. This means the optimization problem will be greatly simpliﬁed if these constraints were not present. By the use of Lagrangian relaxation, the optimization problem is decomposed into smaller ones, which can be solved independently of each other. Computational results show that for some classes of problems, this algorithm can reduce the computational time compared to using a solver which does not take into account the nature of the complicating constraints.

In the second paper, the fact that many control-related semideﬁnite programs have matrix-valued variables is utilized to speed up computations. This implies that the corresponding basis matrices have a certain low-rank structure which can be exploited when formulating the equations for the search directions, something that was discovered in the 90s and is implemented in LMI Lab. However, much has happened in the area of semidefinite programming since the release of LMI Lab, and new, faster algorithms have been developed. However, the idea of using the lowrank structure in the basis matrices can still be used. We implement this, using the publicly available solver SDPT3 in combination with our code for formulating the system of equations for the search directions. In order to facilitate for potential users, we also describe how the modeling language YALMIP is changed so that this lowrank structure can be tracked, and how the code can be easily interfaced. Computational results show that the computational time is decreased.

1. A Decomposition Algorithm for KYP-SDPs$(function(){PrimeFaces.cw("OverlayPanel","overlay242267",{id:"formSmash:j_idt482:0:j_idt486",widgetVar:"overlay242267",target:"formSmash:j_idt482:0:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

2. Low-Rank Exploitation in Semidefinite Programming for Control$(function(){PrimeFaces.cw("OverlayPanel","overlay317016",{id:"formSmash:j_idt482:1:j_idt486",widgetVar:"overlay317016",target:"formSmash:j_idt482:1:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

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

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