<mediawiki xmlns="http://www.mediawiki.org/xml/export-0.11/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.mediawiki.org/xml/export-0.11/ http://www.mediawiki.org/xml/export-0.11.xsd" version="0.11" xml:lang="en">
  <siteinfo>
    <sitename>Cornell University Computational Optimization Open Textbook - Optimization Wiki</sitename>
    <dbname>optimizationwiki_wiki2</dbname>
    <base>https://optimization.cbe.cornell.edu/index.php?title=Main_Page</base>
    <generator>MediaWiki 1.43.0</generator>
    <case>first-letter</case>
    <namespaces>
      <namespace key="-2" case="first-letter">Media</namespace>
      <namespace key="-1" case="first-letter">Special</namespace>
      <namespace key="0" case="first-letter" />
      <namespace key="1" case="first-letter">Talk</namespace>
      <namespace key="2" case="first-letter">User</namespace>
      <namespace key="3" case="first-letter">User talk</namespace>
      <namespace key="4" case="first-letter">Cornell University Computational Optimization Open Textbook - Optimization Wiki</namespace>
      <namespace key="5" case="first-letter">Cornell University Computational Optimization Open Textbook - Optimization Wiki talk</namespace>
      <namespace key="6" case="first-letter">File</namespace>
      <namespace key="7" case="first-letter">File talk</namespace>
      <namespace key="8" case="first-letter">MediaWiki</namespace>
      <namespace key="9" case="first-letter">MediaWiki talk</namespace>
      <namespace key="10" case="first-letter">Template</namespace>
      <namespace key="11" case="first-letter">Template talk</namespace>
      <namespace key="12" case="first-letter">Help</namespace>
      <namespace key="13" case="first-letter">Help talk</namespace>
      <namespace key="14" case="first-letter">Category</namespace>
      <namespace key="15" case="first-letter">Category talk</namespace>
    </namespaces>
  </siteinfo>
  <page>
    <title>Main Page</title>
    <ns>0</ns>
    <id>1</id>
    <revision>
      <id>7647</id>
      <parentid>6744</parentid>
      <timestamp>2024-12-15T22:35:50Z</timestamp>
      <contributor>
        <username>Wc593</username>
        <id>6</id>
      </contributor>
      <origin>7647</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="8521" sha1="t8yr7iga0y3rzh75f8i7v7ich02b3fq" xml:space="preserve">{| id="mp-topbanner" style="width:100%; background:#f6f6f6; margin-top:1.2em; border:1px solid #ddd;"
| style="width:61%; color:#000;" |
{| style="width:100%; border:none; background:none;"
| style="text-align:center; white-space:nowrap; color:#000;" |
&lt;div style="font-size:162%; border:none; margin:0; padding:.1em; color:#000;"&gt;Welcome to the Cornell University Computational Optimization Open Textbook&lt;/div&gt;

This electronic textbook is a student-contributed open-source text covering a variety of topics on process optimization.&lt;br /&gt;
'''If you have any comments or suggestions on this open textbook, please contact [https://www.engineering.cornell.edu/faculty-directory/fengqi-you  Professor Fengqi You].'''
|}
|}

{| id="mp-upper" style="width: 100%; margin:6px 0 0 0; background:none; border-spacing: 0px;"
| class="MainPageBG" style="width:50%; border:1px solid #cef2e0; background:#f5fffa; vertical-align:top; color:#000;" |
{| id="mp-left" style="width:100%; vertical-align:top; background:#f5fffa;"
! style="padding:2px;" | &lt;h2 id="mp-tfa-h2" style="margin:3px; background:#cef2e0; font-size:120%; font-weight:bold; border:1px solid #a3bfb1; text-align:left; color:#000; padding:0.2em 0.4em;"&gt;Linear Programming (LP)&lt;/h2&gt;
|-
| style="color:#000;" | &lt;div id="mp-tfa" style="padding:2px 5px 5px 15px"&gt;
      &lt;li&gt;[[Duality]]&lt;/li&gt;
      &lt;li&gt;[[Simplex algorithm]]&lt;/li&gt;
      &lt;li&gt;[[Computational complexity]]&lt;/li&gt;
      &lt;li&gt;[[Network flow problem]]&lt;/li&gt;
      &lt;li&gt;[[Interior-point method for LP]]&lt;/li&gt;
      &lt;li&gt;[[Optimization with absolute values]]&lt;/li&gt;
      &lt;li&gt;[[Matrix game (LP for game theory)]]&lt;/li&gt;
&lt;/div&gt;
|-
! style="padding:2px" | &lt;h2 id="mp-dyk-h2" style="margin:3px; background:#cef2e0; font-size:120%; font-weight:bold; border:1px solid #a3bfb1; text-align:left; color:#000; padding:0.2em 0.4em;"&gt;NonLinear Programming (NLP)&lt;/h2&gt;
|-
| style="color:#000;padding:2px 5px 5px 15px" | &lt;div id="mp-dyk"&gt;
      &lt;li&gt;[[Line search methods]]&lt;/li&gt;
      &lt;li&gt;[[Trust-region methods]]&lt;/li&gt;
      &lt;li&gt;[[Interior-point method for NLP]]&lt;/li&gt;
      &lt;li&gt;[[Conjugate gradient methods]]&lt;/li&gt;
      &lt;li&gt;[[Quasi-Newton methods]]&lt;/li&gt;
      &lt;li&gt;[[Quadratic programming]]&lt;/li&gt;
      &lt;li&gt;[[Sequential quadratic programming]]&lt;/li&gt;
      &lt;li&gt;[[Subgradient optimization]]&lt;/li&gt;
      &lt;li&gt;[[Mathematical programming with equilibrium constraints]]&lt;/li&gt;
      &lt;li&gt;[[Dynamic optimization]]&lt;/li&gt;
      &lt;li&gt;[[Geometric programming]]&lt;/li&gt;
      &lt;li&gt;[[Nondifferentiable Optimization]]&lt;/li&gt;
      &lt;li&gt;[[Evolutionary multimodal optimization]]&lt;/li&gt;
      &lt;li&gt;[[Stackelberg leadership model]]&lt;/li&gt;
      &lt;li&gt;[[Quadratic constrained quadratic programming]]&lt;/li&gt;
      &lt;li&gt;[[Derivative free optimization]]&lt;/li&gt;
&lt;/div&gt;
|-
! style="padding:2px" | &lt;h2 id="mp-dyk-h2" style="margin:3px; background:#cef2e0; font-size:120%; font-weight:bold; border:1px solid #a3bfb1; text-align:left; color:#000; padding:0.2em 0.4em;"&gt;Deterministic Global Optimization&lt;/h2&gt;
|-
| style="color:#000;padding:2px 5px 5px 15px" | &lt;div id="mp-dyk"&gt;
      &lt;li&gt;[[Exponential transformation]]&lt;/li&gt;
      &lt;li&gt;[[Logarithmic transformation]]&lt;/li&gt;
      &lt;li&gt;[[McCormick envelopes]]&lt;/li&gt;
      &lt;li&gt;[[Piecewise linear approximation]]&lt;/li&gt;
      &lt;li&gt;[[Spatial branch and bound method]]&lt;/li&gt;
&lt;/div&gt;
|-
! style="padding:2px" | &lt;h2 id="mp-dyk-h2" style="margin:3px; background:#cef2e0; font-size:120%; font-weight:bold; border:1px solid #a3bfb1; text-align:left; color:#000; padding:0.2em 0.4em;"&gt;Dynamic Programming&lt;/h2&gt;
|-
| style="color:#000;padding:2px 5px 5px 15px" | &lt;div id="mp-dyk"&gt;
      &lt;li&gt;[[Markov decision process]]&lt;/li&gt;
      &lt;li&gt;[[Bellman equation]]&lt;/li&gt;
      &lt;li&gt;[[Eight step procedures]]&lt;/li&gt;
      &lt;li&gt;[[Stochastic dynamic programming]]&lt;/li&gt;
&lt;/div&gt;
|-
! style="padding:2px" | &lt;h2 id="mp-dyk-h2" style="margin:3px; background:#cef2e0; font-size:120%; font-weight:bold; border:1px solid #a3bfb1; text-align:left; color:#000; padding:0.2em 0.4em;"&gt;Traditional Applications&lt;/h2&gt;
|-
| style="color:#000;padding:2px 5px 5px 15px" | &lt;div id="mp-dyk"&gt;
      &lt;li&gt;[[Facility location problem]]&lt;/li&gt;
      &lt;li&gt;[[Traveling salesman problem]]&lt;/li&gt;
      &lt;li&gt;[[Set covering problem]]&lt;/li&gt;
      &lt;li&gt;[[Quadratic assignment problem]]&lt;/li&gt;
      &lt;li&gt;[[Job shop scheduling]]&lt;/li&gt;
      &lt;li&gt;[[Newsvendor problem]]&lt;/li&gt; 
      &lt;li&gt;[[Unit commitment problem]]&lt;/li&gt;
      &lt;li&gt;[[Portfolio optimization]]&lt;/li&gt;
      &lt;li&gt;[[A-star algorithm]]&lt;/li&gt;
&lt;/div&gt;

|-
! style="padding:2px" | &lt;h2 id="mp-dyk-h2" style="margin:3px; background:#cef2e0; font-size:120%; font-weight:bold; border:1px solid #a3bfb1; text-align:left; color:#000; padding:0.2em 0.4em;"&gt; Emerging Applications&lt;/h2&gt;
|-
| style="color:#000;padding:2px 5px 5px 15px" | &lt;div id="mp-dyk"&gt;
      &lt;li&gt;[[Wing shape optimization]]&lt;/li&gt;
      &lt;li&gt;[[Optimization in game theory]]&lt;/li&gt;
      &lt;li&gt;[[Quantum computing for optimization]]&lt;/li&gt;
&lt;/div&gt;

|}

| style="border:1px solid transparent;" |
| class="MainPageBG" style="width:50%; border:1px solid #cedff2; background:#f5faff; vertical-align:top;"|
{| id="mp-right" style="width:100%; vertical-align:top; background:#f5faff;"
! style="padding:2px" | &lt;h2 id="mp-otd-h2" style="margin:3px; background:#cedff2; font-size:120%; font-weight:bold; border:1px solid #a3b0bf; text-align:left; color:#000; padding:0.2em 0.4em;"&gt;Mixed-Integer Linear Programming (MILP)&lt;/h2&gt;
|-
| style="color:#000;padding:2px 5px 5px 15px" | &lt;div id="mp-otd"&gt;
      &lt;li&gt;[[Mixed-integer cuts]]&lt;/li&gt;
      &lt;li&gt;[[Disjunctive inequalities]]&lt;/li&gt;
      &lt;li&gt;[[Lagrangean duality]]&lt;/li&gt;
      &lt;li&gt;[[Column generation algorithms]]&lt;/li&gt;
      &lt;li&gt;[[Heuristic algorithms]]&lt;/li&gt;
      &lt;li&gt;[[Branch and cut]]&lt;/li&gt;
      &lt;li&gt;[[Local branching]]&lt;/li&gt;&lt;/div&gt;
|-
! style="padding:2px" | &lt;h2 id="mp-otd-h2" style="margin:3px; background:#cedff2; font-size:120%; font-weight:bold; border:1px solid #a3b0bf; text-align:left; color:#000; padding:0.2em 0.4em;"&gt;Mixed-Integer NonLinear Programming (MINLP)&lt;/h2&gt;
|-
| style="color:#000;padding:2px 5px 5px 15px" | &lt;div id="mp-otd"&gt;
      &lt;li&gt;[[Signomial problems]]&lt;/li&gt;
      &lt;li&gt;[[Mixed-integer linear fractional programming (MILFP)]]&lt;/li&gt;
      &lt;li&gt;[[Convex generalized disjunctive programming (GDP)]]&lt;/li&gt;
      &lt;li&gt;[[Nonconvex generalized disjunctive programming (GDP)]]&lt;/li&gt;
      &lt;li&gt;[[Branch and bound (BB) for MINLP]]&lt;/li&gt;
      &lt;li&gt;[[Branch and cut for MINLP]]&lt;/li&gt;
      &lt;li&gt;[[Generalized Benders decomposition (GBD)]]&lt;/li&gt;
      &lt;li&gt;[[Outer-approximation (OA)]]&lt;/li&gt;
      &lt;li&gt;[[Extended cutting plane (ECP)]]&lt;/li&gt;
&lt;/div&gt;
|-
! style="padding:2px" | &lt;h2 id="mp-otd-h2" style="margin:3px; background:#cedff2; font-size:120%; font-weight:bold; border:1px solid #a3b0bf; text-align:left; color:#000; padding:0.2em 0.4em;"&gt;Optimization under Uncertainty&lt;/h2&gt;
|-
| style="color:#000;padding:2px 5px 5px 15px" | &lt;div id="mp-dyk"&gt;
      &lt;li&gt;[[Stochastic programming]]&lt;/li&gt;
      &lt;li&gt;[[Chance-constraint method]]&lt;/li&gt;
      &lt;li&gt;[[Fuzzy programming]]&lt;/li&gt;
      &lt;li&gt;[[Classical robust optimization]]&lt;/li&gt;
      &lt;li&gt;[[Adaptive robust optimization]]&lt;/li&gt;
      &lt;li&gt;[[Data driven robust optimization]]&lt;/li&gt;
&lt;/div&gt;
|-
! style="padding:2px" | &lt;h2 id="mp-otd-h2" style="margin:3px; background:#cedff2; font-size:120%; font-weight:bold; border:1px solid #a3b0bf; text-align:left; color:#000; padding:0.2em 0.4em;"&gt;Optimization for Machine Learning and Data Analytics&lt;/h2&gt;
|-
| style="color:#000;padding:2px 5px 5px 15px" | &lt;div id="mp-dyk"&gt;
      &lt;li&gt;[[Stochastic gradient descent]]&lt;/li&gt;
      &lt;li&gt;[[Momentum]]&lt;/li&gt;
      &lt;li&gt;[[AdaGrad]]&lt;/li&gt;
      &lt;li&gt;[[RMSProp]]&lt;/li&gt;
      &lt;li&gt;[[Adam]]&lt;/li&gt;
      &lt;li&gt;[[Frank-Wolfe]]&lt;/li&gt;
      &lt;li&gt;[[Sparse Reconstruction with Compressed Sensing]]&lt;/li&gt;
      &lt;li&gt;[[Adadelta]]&lt;/li&gt;
      &lt;li&gt;[[Adafactor]]&lt;/li&gt;
      &lt;li&gt;[[AdamW]]&lt;/li&gt;
      &lt;li&gt;[[Adamax]]&lt;/li&gt;
      &lt;li&gt;[[FTRL algorithm]]&lt;/li&gt;
      &lt;li&gt;[[Lion algorithm]]&lt;/li&gt;
      &lt;li&gt;[[LossScaleOptimizer]]&lt;/li&gt;
      &lt;li&gt;[[Nadam]]&lt;/li&gt;
&lt;/div&gt;
|-
! style="padding:2px" | &lt;h2 id="mp-otd-h2" style="margin:3px; background:#cedff2; font-size:120%; font-weight:bold; border:1px solid #a3b0bf; text-align:left; color:#000; padding:0.2em 0.4em;"&gt;Black-box Optimization&lt;/h2&gt;
|-
| style="color:#000;padding:2px 5px 5px 15px" | &lt;div id="mp-dyk"&gt;
      &lt;li&gt;[[Bayesian optimization]]&lt;/li&gt;
      &lt;li&gt;[[Genetic algorithm]]&lt;/li&gt;
      &lt;li&gt;[[Simulated annealing]]&lt;/li&gt;
      &lt;li&gt;[[Particle swarm optimization]]&lt;/li&gt;
      &lt;li&gt;[[Differential evolution]]&lt;/li&gt;
&lt;/div&gt;
|}
|}

== Sponsor ==
[[File:Peese-logo.jpg|Cornell Prof. Fengqi You Research Group |link=https://www.peese.org]]

&lt;/noinclude&gt;__NOTOC____NOEDITSECTION__</text>
      <sha1>t8yr7iga0y3rzh75f8i7v7ich02b3fq</sha1>
    </revision>
  </page>
</mediawiki>
