<node id="624232">
  <nid>624232</nid>
  <type>event</type>
  <uid>
    <user id="34868"><![CDATA[34868]]></user>
  </uid>
  <created>1565357456</created>
  <changed>1568209253</changed>
  <title><![CDATA[ISyE Department Seminar - Juan Pablo Vielma]]></title>
  <body><![CDATA[<p><strong>Abstract:</strong></p>

<p>More than 50 years of development have made mixed integer linear<br />
programming (MILP) an extremely successful tool. MILP&rsquo;s modeling<br />
flexibility allows it describe a wide range of business, engineering<br />
and scientific problems, and, while MILP is NP-hard, many of these<br />
problems are routinely solved in practice thanks to state-of-the-art<br />
solvers that nearly double their machine-independent speeds every<br />
year. Inspired by this success, the last decade has seen a surge of<br />
activity on the solution and application of mixed integer convex<br />
programming (MICP), which extends MILP&rsquo;s versatility by allowing the<br />
use of convex constraints in addition to linear inequalities. In this<br />
talk we cover various recent developments concerning theory,<br />
algorithms and computation for MICP. Solvers for MICP can be<br />
significantly more effective than those for more general non-convex<br />
optimization, so one of the questions we cover in this talk is what<br />
classes of non-convex constraints can be modeled through MICP. We also<br />
cover various topics concerning the modeling and computational<br />
solution of MICP problems using the Julia programming language and the<br />
JuMP modeling language for optimization. In particular, we show how<br />
mixed integer optimal control problems where the variables are<br />
polynomials can be easily modeled and solved by seamlessly combining<br />
several Julia packages and JuMP extensions with the Julia-written MICP<br />
solver Pajarito.jl. Finally, we introduce the Julia-based interior<br />
point solver for general non-symmetric cones Hypatia.jl, and show how<br />
its use of non-standard cones can allow it to outperform commercial<br />
solvers in certain instances.<br />
<br />
<strong>Bio</strong><br />
<br />
Juan Pablo Vielma is the Richard S. Leghorn (1939) Career Development<br />
Associate Professor at MIT Sloan School of Management and is<br />
affiliated to MIT&rsquo;s Operations Research Center. Dr. Vielma has a B.S.<br />
in Mathematical Engineering from University of Chile and a Ph.D. in<br />
Industrial Engineering from the Georgia Institute of Technology. His<br />
current research interests include the theory and practice of<br />
mixed-integer mathematical optimization and applications in energy,<br />
natural resource management, marketing and statistics. In January of<br />
2017 he was named by President Obama as one of the recipients of the<br />
Presidential Early Career Award for Scientists and Engineers (PECASE).<br />
Some of his other recognitions include the NSF CAREER Award and the<br />
INFORMS Computing Society Prize. He is currently an associate editor<br />
for Operations Research and Operations Research Letters, a member of<br />
the board of directors of the INFORMS Computing Society, and a member<br />
of the NumFocus steering committee for JuMP.</p>
]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Modeling Power of Mixed Integer Convex Optimization Problems And Their Effective Solution with Julia and JuMP]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[<p><strong>Abstract:</strong></p>

<p>More than 50 years of development have made mixed integer linear<br />
programming (MILP) an extremely successful tool. MILP&rsquo;s modeling<br />
flexibility allows it describe a wide range of business, engineering<br />
and scientific problems, and, while MILP is NP-hard, many of these<br />
problems are routinely solved in practice thanks to state-of-the-art<br />
solvers that nearly double their machine-independent speeds every<br />
year. Inspired by this success, the last decade has seen a surge of<br />
activity on the solution and application of mixed integer convex<br />
programming (MICP), which extends MILP&rsquo;s versatility by allowing the<br />
use of convex constraints in addition to linear inequalities. In this<br />
talk we cover various recent developments concerning theory,<br />
algorithms and computation for MICP. Solvers for MICP can be<br />
significantly more effective than those for more general non-convex<br />
optimization, so one of the questions we cover in this talk is what<br />
classes of non-convex constraints can be modeled through MICP. We also<br />
cover various topics concerning the modeling and computational<br />
solution of MICP problems using the Julia programming language and the<br />
JuMP modeling language for optimization. In particular, we show how<br />
mixed integer optimal control problems where the variables are<br />
polynomials can be easily modeled and solved by seamlessly combining<br />
several Julia packages and JuMP extensions with the Julia-written MICP<br />
solver Pajarito.jl. Finally, we introduce the Julia-based interior<br />
point solver for general non-symmetric cones Hypatia.jl, and show how<br />
its use of non-standard cones can allow it to outperform commercial<br />
solvers in certain instances.</p>
]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2019-09-11T14:30:00-04:00]]></value>
      <value2><![CDATA[2019-09-11T15:30: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[Faculty/Staff]]></value>
      </item>
          <item>
        <value><![CDATA[Postdoc]]></value>
      </item>
          <item>
        <value><![CDATA[Public]]></value>
      </item>
          <item>
        <value><![CDATA[Graduate students]]></value>
      </item>
          <item>
        <value><![CDATA[Undergraduate students]]></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[https://www.isye.gatech.edu/about/maps-directions/isye-building-complex]]></url>
      <title><![CDATA[ISyE Building Complex]]></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>1242</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[School of Industrial and Systems Engineering (ISYE)]]></item>
      </og_groups_both>
  <field_categories>
          <item>
        <tid>1795</tid>
        <value><![CDATA[Seminar/Lecture/Colloquium]]></value>
      </item>
      </field_categories>
  <field_keywords>
      </field_keywords>
  <field_userdata><![CDATA[]]></field_userdata>
</node>
