<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:community="http://www.bibsonomy.org/ontologies/2008/05/community#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xml:base="https://puma.ub.uni-stuttgart.de/tag/optimization%20programs"><owl:Ontology rdf:about=""><rdfs:comment>PUMA publications for /tag/optimization%20programs</rdfs:comment><owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/></owl:Ontology><rdf:Description rdf:about="https://puma.ub.uni-stuttgart.de/bibtex/2b9e0ef26b3072dde1659125d18d60b7c/carsten.scherer"><owl:sameAs rdf:resource="/uri/bibtex/2b9e0ef26b3072dde1659125d18d60b7c/carsten.scherer"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="https://doi.org/10.1080/00207170701730451"/><swrc:date>Tue Dec 07 20:40:52 CET 2021</swrc:date><swrc:journal>Int. J. Control</swrc:journal><swrc:number>5</swrc:number><swrc:pages>851-864</swrc:pages><swrc:title>{R}obust $l_1$ performance analysis for linear systems with parametric uncertainties</swrc:title><swrc:volume>81</swrc:volume><swrc:year>2008</swrc:year><swrc:keywords>EXC310 approach dependent functions imng inequality lyapunov matrix optimization peerReviewed pn4 programs relaxations </swrc:keywords><swrc:abstract>In this contribution, a computational approach for analysing the robust e.-gain (or the robust l(1) performance) of uncertain linear systems is developed. In particular, the system&#039;s state-space matrices may have a rational dependence on structured parametric time-invariant or time-varying uncertainties. The computation is based on robust semi-definite programming and provides a trade-off between accuracy and computational effort. A novel matrix inequality condition to determine the star-norm of discrete-time systems is derived as an auxiliary result.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="Robust l(1) performance analysis for linear systems with parametric uncertainties" swrc:key="shorttitle"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="&lt;Go to ISI&gt;://000255553000012" swrc:key="file"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="Journal Article" swrc:key="endnotereftype"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="J. M. Rieber"/></rdf:_1><rdf:_2><swrc:Person swrc:name="C. W. Scherer"/></rdf:_2><rdf:_3><swrc:Person swrc:name="F. Allgower"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="https://puma.ub.uni-stuttgart.de/bibtex/2b9e0ef26b3072dde1659125d18d60b7c/mathematik"><owl:sameAs rdf:resource="/uri/bibtex/2b9e0ef26b3072dde1659125d18d60b7c/mathematik"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="https://doi.org/10.1080/00207170701730451"/><swrc:date>Wed Dec 01 20:49:49 CET 2021</swrc:date><swrc:journal>Int. J. Control</swrc:journal><swrc:month>may</swrc:month><swrc:number>5</swrc:number><swrc:pages>851-864</swrc:pages><swrc:title>{R}obust $l_1$ performance analysis for linear systems with parametric uncertainties</swrc:title><swrc:volume>81</swrc:volume><swrc:year>2008</swrc:year><swrc:keywords>approach lyapunov functions relaxations imng matrix inequality from:carsten.scherer EXC310 optimization pn4 peerReviewed programs dependent </swrc:keywords><swrc:abstract>In this contribution, a computational approach for analysing the robust e.-gain (or the robust l(1) performance) of uncertain linear systems is developed. In particular, the system&#039;s state-space matrices may have a rational dependence on structured parametric time-invariant or time-varying uncertainties. The computation is based on robust semi-definite programming and provides a trade-off between accuracy and computational effort. A novel matrix inequality condition to determine the star-norm of discrete-time systems is derived as an auxiliary result.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="Robust l(1) performance analysis for linear systems with parametric uncertainties" swrc:key="shorttitle"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="&lt;Go to ISI&gt;://000255553000012" swrc:key="file"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="0020-7179" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="Journal Article" swrc:key="endnotereftype"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="J. M. Rieber"/></rdf:_1><rdf:_2><swrc:Person swrc:name="C. W. Scherer"/></rdf:_2><rdf:_3><swrc:Person swrc:name="F. Allgower"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><foaf:Group rdf:about="https://puma.ub.uni-stuttgart.de/tag/optimization%20programs"><foaf:name>optimization programs</foaf:name><description>Community for tag(s) optimization programs</description></foaf:Group></rdf:RDF>