<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445877871</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317145533.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20110901xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s11081-010-9120-4</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s11081-010-9120-4</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="2">
   <subfield code="a">A nonlinear programming technique to compute atightlower bound for the real structured singular value</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Ahmet Yazıcı, Abdurrahman Karamancıoğlu, Refail Kasimbeyli]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">The real structured singular value (RSSV, or real μ) is a useful measure to analyze the robustness of linear systems subject to structured real parametric uncertainty, and surely a valuable design tool for the control systems engineers. We formulate the RSSV problem as a nonlinear programming problem and use a new computation technique, F-modified subgradient (F-MSG) algorithm, for its lower bound computation. The F-MSG algorithm can handle a large class of nonconvex optimization problems and requires no differentiability. The RSSV computation is a well known NP hard problem. There are several approaches that propose lower and upper bounds for the RSSV. However, with the existing approaches, the gap between the lower and upper bounds is large for many problems so that the benefit arising from usage of RSSV is reduced significantly. Although the F-MSG algorithm aims to solve the nonconvex programming problems exactly, its performance depends on the quality of the standard solvers used for solving subproblems arising at each iteration of the algorithm. In the case it does not find the optimal solution of the problem, due to its high performance, it practically produces a very tight lower bound. Considering that the RSSV problem can be discontinuous, it is found to provide a good fit to the problem. We also provide examples for demonstrating the validity of our approach.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media, LLC, 2010</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Robust control</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Real structured singular value</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Nonlinear programming</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Modified subgradient algorithm</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Yazıcı</subfield>
   <subfield code="D">Ahmet</subfield>
   <subfield code="u">Computer Engineering Department, Osmangazi University, 26480, Eskişehir, Turkey</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Karamancıoğlu</subfield>
   <subfield code="D">Abdurrahman</subfield>
   <subfield code="u">Electrical Engineering Department, Osmangazi University, 26480, Eskişehir, Turkey</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Kasimbeyli</subfield>
   <subfield code="D">Refail</subfield>
   <subfield code="u">Department of Industrial Systems Engineering, Izmir University of Economics, 35330, Izmir, Turkey</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Optimization and Engineering</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">12/3(2011-09-01), 445-458</subfield>
   <subfield code="x">1389-4420</subfield>
   <subfield code="q">12:3&lt;445</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">12</subfield>
   <subfield code="o">11081</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s11081-010-9120-4</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s11081-010-9120-4</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Yazıcı</subfield>
   <subfield code="D">Ahmet</subfield>
   <subfield code="u">Computer Engineering Department, Osmangazi University, 26480, Eskişehir, Turkey</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Karamancıoğlu</subfield>
   <subfield code="D">Abdurrahman</subfield>
   <subfield code="u">Electrical Engineering Department, Osmangazi University, 26480, Eskişehir, Turkey</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Kasimbeyli</subfield>
   <subfield code="D">Refail</subfield>
   <subfield code="u">Department of Industrial Systems Engineering, Izmir University of Economics, 35330, Izmir, Turkey</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Optimization and Engineering</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">12/3(2011-09-01), 445-458</subfield>
   <subfield code="x">1389-4420</subfield>
   <subfield code="q">12:3&lt;445</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">12</subfield>
   <subfield code="o">11081</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
