<node id="685256">
  <nid>685256</nid>
  <type>event</type>
  <uid>
    <user id="28475"><![CDATA[28475]]></user>
  </uid>
  <created>1758749685</created>
  <changed>1758749816</changed>
  <title><![CDATA[Ph.D. Dissertation Defense - Rachel Harris]]></title>
  <body><![CDATA[<p><strong>Title</strong><em>:&nbsp; Computational Methods for Fast and Secure Distributed Optimal Power Flow</em></p><p><strong>Committee:</strong></p><p>Dr.&nbsp;Daniel Molzahn, ECE, Chair, Advisor</p><p>Dr.&nbsp;Sakis Meliopoulos, ECE</p><p>Dr.&nbsp;Constance Crozier, ISyE</p><p>Dr.&nbsp;Chin-Yao Chang, NRL</p><p>Dr.&nbsp;Santiago Grijalva, ECE</p>]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Computational Methods for Fast and Secure Distributed Optimal Power Flow ]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[<p>Distributed optimization algorithms may be used to coordinate large numbers of distributed energy resources (DERs) across transmission and distribution networks in the future power grid. These distributed algorithms have the potential to preserve privacy and autonomy while coordinating interconnected systems, and to improve scalability for large problems. However, there are challenges that must be addressed before implementing distributed algorithms for real-world system operation. First, distributed optimal power flow (OPF) requires repeated communication between controllers, which creates vulnerability to cyberattacks. Second, distributed OPF often takes many iterations to converge for large-scale power systems. Third, many traditional distributed optimization algorithms lack convergence guarantees for mixed-integer problems, which makes it difficult to solve problems with discrete decisions in a distributed manner. This dissertation explores methods to improve data security and reduce computation time for distributed OPF. First, this dissertation presents a machine learning-based method to detect and mitigate data integrity attacks on information shared between controllers. Second, it explores the impact of convergence tolerance, and introduces a bound tightening algorithm to prevent constraint violations at the distributed OPF operating point for a given convergence tolerance. Third, the dissertation reduces computation time by securely computing a distributed OPF warm start using privacy-preserving neural networks. The secure warm start can be combined with bound tightening to drastically reduce the number of iterations required to converge, thus reducing computation time and improving data security. Fourth, the dissertation explores making large-scale integrated transmission-distribution switching problems more tractable. To this end, the dissertation proposes developing reduced network models to be used with hierarchical optimization methods, and evaluates performance on realistic, large-scale synthetic distribution networks.</p>]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2025-09-29T13:00:00-04:00]]></value>
      <value2><![CDATA[2025-09-29T15:00:00-04: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[Room 1120A, Klaus]]></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>434381</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[ECE Ph.D. Dissertation Defenses]]></item>
      </og_groups_both>
  <field_categories>
          <item>
        <tid>1788</tid>
        <value><![CDATA[Other/Miscellaneous]]></value>
      </item>
      </field_categories>
  <field_keywords>
          <item>
        <tid>100811</tid>
        <value><![CDATA[Phd Defense]]></value>
      </item>
          <item>
        <tid>1808</tid>
        <value><![CDATA[graduate students]]></value>
      </item>
      </field_keywords>
  <field_userdata><![CDATA[]]></field_userdata>
</node>
