<node id="583489">
  <nid>583489</nid>
  <type>event</type>
  <uid>
    <user id="27707"><![CDATA[27707]]></user>
  </uid>
  <created>1478190489</created>
  <changed>1478190509</changed>
  <title><![CDATA[PhD Proposal by Matthew Gross]]></title>
  <body><![CDATA[<div>
<p>Ph.D. Thesis Proposal by</p>

<p><strong>Matthew Gross</strong></p>

<p><strong>Advisor: </strong>Dr. Mark Costello</p>

<p>&nbsp;</p>

<p>META-OPTIMIZATION WITH APPLICATION TO AEROSPACE SYSTEM IDENTIFICATION</p>

<p>&nbsp;</p>

<p><strong>3 PM Tuesday, November 15, 2016</strong></p>

<p>Montgomery-Knight Room 317</p>

<p>&nbsp;</p>

<p><strong>Abstract</strong></p>

<p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Optimization is a powerful tool for solving practical engineering problems, including identification for aerospace systems.&nbsp; Due to the complexity of many optimization problems, numerical methods are often employed to obtain solutions.&nbsp; A diverse collection of numerical optimization methods have been developed, each suited for different types of problems.&nbsp; Local search methods are highly efficient on convex problems, but require good initial guesses to find the global optimum.&nbsp; Global methods are able to search the entire parameter space to determine the global optimum, often at the cost of increased computation time.&nbsp; Given the fact that no one optimization algorithm performs well on every problem, the selection of the proper algorithm for a given problem is a critical decision by an engineer.</p>

<p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; To overcome the algorithm selection problem, this work proposes a new method for automatically selecting and deploying optimizers, dubbed meta-optimization.&nbsp; The goal of meta-optimization is to intelligently deploy a diverse set of optimization algorithms, leveraging the strengths of each algorithm and minimizing their weaknesses in order to reliably and accurately solve challenging optimization problems with minimal user intervention.&nbsp; The first component of the meta-optimizer is the bank of optimization algorithms which includes numerous local and global search methods.&nbsp; Algorithm selection is performed in an online manner, choosing the most effective algorithms at the current stage of the solution process.&nbsp; The meta-optimizer must also ensure smooth transition between different algorithms and prevent premature convergence in local optima.&nbsp; Finally, the meta-optimizer tunes optimization algorithms parameters which degrade performance of the algorithm.</p>

<p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; The meta-optimizer is first tested on a set of benchmark functions and then used to solve two aerospace system identification problems.&nbsp; The first problem considered is the estimation of parameters for a new smart projectile system.&nbsp; Both simulated and experimental spark range data is used to estimate the body and control mechanism parameters.&nbsp; The second application is the calibration of inertial measurement units (IMUs) for onboard sensing of precision guided air drop systems using simulated and experimental calibration table data.&nbsp;</p>

<p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;</p>

<p><strong>Committee Members</strong></p>
</div>

<p>&nbsp;</p>

<p>Dr. Mark Costello, AE (Advisor)</p>

<p>Dr. Brian German, AE</p>

<p>Dr. Eric Johnson, AE</p>

<p>Dr. Graeme Kennedy, AE</p>

<p>Dr. Aldo Ferri, ME</p>
]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Meta-Optomization with Application to Aerospace System Identification]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2016-11-15T15:00:00-05:00]]></value>
      <value2><![CDATA[2016-11-15T17:00:00-05:00]]></value2>
      <rrule><![CDATA[]]></rrule>
      <timezone><![CDATA[America/New_York]]></timezone>
    </item>
  </field_time>
  <field_fee>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_fee>
  <field_extras>
      </field_extras>
  <field_audience>
          <item>
        <value><![CDATA[Public]]></value>
      </item>
      </field_audience>
  <field_media>
      </field_media>
  <field_contact>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_contact>
  <field_location>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_location>
  <field_sidebar>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_sidebar>
  <field_phone>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_phone>
  <field_url>
    <item>
      <url><![CDATA[]]></url>
      <title><![CDATA[]]></title>
            <attributes><![CDATA[]]></attributes>
    </item>
  </field_url>
  <field_email>
    <item>
      <email><![CDATA[]]></email>
    </item>
  </field_email>
  <field_boilerplate>
    <item>
      <nid><![CDATA[]]></nid>
    </item>
  </field_boilerplate>
  <links_related>
      </links_related>
  <files>
      </files>
  <og_groups>
          <item>221981</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[Graduate Studies]]></item>
      </og_groups_both>
  <field_categories>
          <item>
        <tid>1788</tid>
        <value><![CDATA[Other/Miscellaneous]]></value>
      </item>
      </field_categories>
  <field_keywords>
          <item>
        <tid>102851</tid>
        <value><![CDATA[Phd proposal]]></value>
      </item>
      </field_keywords>
  <field_userdata><![CDATA[]]></field_userdata>
</node>
