<node id="671234">
  <nid>671234</nid>
  <type>event</type>
  <uid>
    <user id="28475"><![CDATA[28475]]></user>
  </uid>
  <created>1701104129</created>
  <changed>1701104147</changed>
  <title><![CDATA[Ph.D. Dissertation Defense - Paprapee Buason]]></title>
  <body><![CDATA[<p><span><span><strong><span>Title</span></strong><em><span>:&nbsp; </span></em><em><span>Sample-Based Power Flow Approximations: Computational Methods, Analysis, and Applications</span></em></span></span></p>

<p><span><span><strong><span>Committee:</span></strong></span></span></p>

<p><span><span><span>Dr. </span><span>Daniel Molzahn, ECE, Chair</span><span>, Advisor</span></span></span></p>

<p><span><span><span>Dr. </span><span>Sakis Meliopoulos, ECE</span></span></span></p>

<p><span><span><span>Dr. </span><span>Justin Romberg, ECE</span></span></span></p>

<p><span><span><span>Dr. </span><span>Santiago Grijalva, ECE</span></span></span></p>

<p><span><span><span>Dr. </span><span>Constance Crozier, ISyE</span></span></span></p>
]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Sample-Based Power Flow Approximations: Computational Methods, Analysis, and Applications ]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[<p>The non-convex nature of the power flow equations poses a challenge for solving various power system optimization and control problems. To address these challenges, linear approximations are often employed. However, the accuracy of these linearizations can vary depending on the characteristics of the systems and the operational range. Existing linearizations typically rely on general assumptions that apply to broad classes of systems, which can result in constraint violations. In contrast to these existing approaches, we introduce conservative linear approximations of the power flow equations that intentionally over- or underestimate quantities of interest, aiming to make algorithms more tractable while avoiding constraint violations. Additionally, we introduce rational approximations with linear numerators and denominators. This choice is motivated by the resulting linear inequality constraints, making these approximations well-suited for optimization formulations, while still providing enhanced accuracy compared to linear functions. We enhance the conservativeness and accuracy of our approximations through an iterative sampling method. To further develop our approach, we establish an importance sampling method for constructing conservative linear approximations. This method's objective is to efficiently select the most informative samples. It does so by drawing samples from a relatively low-dimensional subspace exhibiting high curvature. This approach allows us to obtain highly accurate linear approximations with significantly fewer samples than random selection. Furthermore, we examine applications of conservative linear approximations in an optimal sensor placement problem that we formulate as a bilevel program. Our goals are to place a minimal number of sensors, avoid false sensor alarms, and ensure that sensors will detect any voltage violations. To make the bilevel problem tractable, we replace the nonlinear power flow equations with conservative linear approximations and apply various problem reformulations to significantly improve computational tractability while simultaneously ensuring an appropriate placement of sensors.</p>
]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2023-12-05T14:00:00-05:00]]></value>
      <value2><![CDATA[2023-12-05T16: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[Room W218, Van Leer]]></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>
  <userdata><![CDATA[]]></userdata>
</node>
