Main Page: Difference between revisions

Latest revision as of 20:45, 9 October 2023

Welcome to the Cornell University Computational Optimization Open Textbook

This electronic textbook is a student-contributed open-source text covering a variety of topics on process optimization.
If you have any comments or suggestions on this open textbook, please contact Professor Fengqi You.

Linear Programming (LP)
Duality Simplex algorithm Computational complexity Network flow problem Interior-point method for LP Optimization with absolute values Matrix game (LP for game theory)
NonLinear Programming (NLP)
Line search methods Trust-region methods Interior-point method for NLP Conjugate gradient methods Quasi-Newton methods Quadratic programming Sequential quadratic programming Subgradient optimization Mathematical programming with equilibrium constraints Dynamic optimization Geometric programming Nondifferentiable Optimization
Deterministic Global Optimization
Exponential transformation Logarithmic transformation McCormick envelopes Piecewise linear approximation Spatial branch and bound method
Dynamic Programming
Markov decision process Bellman equation Eight step procedures Stochastic dynamic programming
Traditional Applications
Facility location problem Traveling salesman problem Set covering problem Quadratic assignment problem Job shop scheduling Newsvendor problem Unit commitment problem Portfolio optimization

Mixed-Integer Linear Programming (MILP)
Mixed-integer cuts Disjunctive inequalities Lagrangean duality Column generation algorithms Heuristic algorithms Branch and cut Local branching
Mixed-Integer NonLinear Programming (MINLP)
Signomial problems Mixed-integer linear fractional programming (MILFP) Convex generalized disjunctive programming (GDP) Nonconvex generalized disjunctive programming (GDP) Branch and bound (BB) for MINLP Branch and cut for MINLP Generalized Benders decomposition (GBD) Outer-approximation (OA) Extended cutting plane (ECP)
Optimization under Uncertainty
Stochastic programming Chance-constraint method Fuzzy programming Classical robust optimization Adaptive robust optimization Data driven robust optimization
Optimization for Machine Learning and Data Analytics
Stochastic gradient descent Momentum AdaGrad RMSProp Adam Frank-Wolfe Sparse Reconstruction with Compressed Sensing
Emerging Applications
Wing shape optimization Optimization in game theory Quantum computing for optimization

@@ Line 15: / Line 15: @@
 ! style="padding:2px;" | <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;">Linear Programming (LP)</h2>
 |-
-| style="color:#000;" | <div id="mp-tfa" style="padding:2px 5px">
+| style="color:#000;" | <div id="mp-tfa" style="padding:2px 5px 5px 15px">
        <li>[[Duality]]</li>
        <li>[[Simplex algorithm]]</li>
@@ Line 27: / Line 27: @@
 ! style="padding:2px" | <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;">NonLinear Programming (NLP)</h2>
 |-
-| style="color:#000;padding:2px 5px 5px" | <div id="mp-dyk">
+| style="color:#000;padding:2px 5px 5px 15px" | <div id="mp-dyk">
        <li>[[Line search methods]]</li>
        <li>[[Trust-region methods]]</li>
@@ Line 44: / Line 44: @@
 ! style="padding:2px" | <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;">Deterministic Global Optimization</h2>
 |-
-| style="color:#000;padding:2px 5px 5px" | <div id="mp-dyk">
+| style="color:#000;padding:2px 5px 5px 15px" | <div id="mp-dyk">
        <li>[[Exponential transformation]]</li>
        <li>[[Logarithmic transformation]]</li>
@@ Line 54: / Line 54: @@
 ! style="padding:2px" | <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;">Dynamic Programming</h2>
 |-
-| style="color:#000;padding:2px 5px 5px" | <div id="mp-dyk">
+| style="color:#000;padding:2px 5px 5px 15px" | <div id="mp-dyk">
        <li>[[Markov decision process]]</li>
        <li>[[Bellman equation]]</li>
@@ Line 63: / Line 63: @@
 ! style="padding:2px" | <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;">Traditional Applications</h2>
 |-
-| style="color:#000;padding:2px 5px 5px" | <div id="mp-dyk">
+| style="color:#000;padding:2px 5px 5px 15px" | <div id="mp-dyk">
        <li>[[Facility location problem]]</li>
        <li>[[Traveling salesman problem]]</li>
-      <li>[[Portfolio optimization]]</li>
        <li>[[Set covering problem]]</li>
-      <li>[[Unit commitment problem]]</li>
        <li>[[Quadratic assignment problem]]</li>
+      <li>[[Job shop scheduling]]</li>
        <li>[[Newsvendor problem]]</li>
+      <li>[[Unit commitment problem]]</li>
+      <li>[[Portfolio optimization]]</li>
 </div>
 |}
 | style="border:1px solid transparent;" |
-<!--        IN THE NEWS; ON THIS DAY        -->
 | 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" | <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;">Mixed-Integer Linear Programming (MILP)</h2>
 |-
-| style="color:#000;padding:2px 5px 5px" | <div id="mp-otd">
+| style="color:#000;padding:2px 5px 5px 15px" | <div id="mp-otd">
        <li>[[Mixed-integer cuts]]</li>
        <li>[[Disjunctive inequalities]]</li>
@@ Line 87: / Line 88: @@
        <li>[[Heuristic algorithms]]</li>
        <li>[[Branch and cut]]</li>
-       <li>[[Local branching]]</li>
+       <li>[[Local branching]]</li></div>
-      <li>[[Feasibility pump]]</li>
-</div>
 |-
 ! style="padding:2px" | <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;">Mixed-Integer NonLinear Programming (MINLP)</h2>
 |-
-| style="color:#000;padding:2px 5px 5px" | <div id="mp-otd">
+| style="color:#000;padding:2px 5px 5px 15px" | <div id="mp-otd">
        <li>[[Signomial problems]]</li>
        <li>[[Mixed-integer linear fractional programming (MILFP)]]</li>
-       <li>[[Convex Generalized disjunctive programming (GDP)]]</li>
+       <li>[[Convex generalized disjunctive programming (GDP)]]</li>
-       <li>[[Nonconvex Generalized disjunctive programming (GDP)]]</li>
+       <li>[[Nonconvex generalized disjunctive programming (GDP)]]</li>
        <li>[[Branch and bound (BB) for MINLP]]</li>
        <li>[[Branch and cut for MINLP]]</li>
@@ Line 107: / Line 106: @@
 ! style="padding:2px" | <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;">Optimization under Uncertainty</h2>
 |-
-| style="color:#000;padding:2px 5px 5px" | <div id="mp-dyk">
+| style="color:#000;padding:2px 5px 5px 15px" | <div id="mp-dyk">
        <li>[[Stochastic programming]]</li>
        <li>[[Chance-constraint method]]</li>
        <li>[[Fuzzy programming]]</li>
        <li>[[Classical robust optimization]]</li>
-      <li>[[Distributionally robust optimization]]</li>
        <li>[[Adaptive robust optimization]]</li>
        <li>[[Data driven robust optimization]]</li>
@@ Line 119: / Line 117: @@
 ! style="padding:2px" | <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;">Optimization for Machine Learning and Data Analytics</h2>
 |-
-| style="color:#000;padding:2px 5px 5px" | <div id="mp-dyk">
+| style="color:#000;padding:2px 5px 5px 15px" | <div id="mp-dyk">
        <li>[[Stochastic gradient descent]]</li>
        <li>[[Momentum]]</li>
@@ Line 125: / Line 123: @@
        <li>[[RMSProp]]</li>
        <li>[[Adam]]</li>
-      <li>[[Alternating direction method of multiplier (ADMM)]]</li>
        <li>[[Frank-Wolfe]]</li>
+      <li>[[Sparse Reconstruction with Compressed Sensing]]</li>
 </div>
 |-
 ! style="padding:2px" | <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;">Emerging Applications</h2>
 |-
-| style="color:#000;padding:2px 5px 5px" | <div id="mp-dyk">
+| style="color:#000;padding:2px 5px 5px 15px" | <div id="mp-dyk">
-      <li>[[Protein folding problem]]</li>
+       <li>[[Wing shape optimization]]</li>
-       <li>[[Wing Shape Optimization]]</li>
+       <li>[[Optimization in game theory]]</li>
-       <li>[[Optimization in Game Theory]]</li>
        <li>[[Quantum computing for optimization]]</li>
 </div>

Main Page: Difference between revisions

Latest revision as of 20:45, 9 October 2023

Linear Programming (LP)

NonLinear Programming (NLP)

Deterministic Global Optimization

Dynamic Programming

Traditional Applications

Mixed-Integer Linear Programming (MILP)

Mixed-Integer NonLinear Programming (MINLP)

Optimization under Uncertainty

Optimization for Machine Learning and Data Analytics

Emerging Applications

Sponsor

Navigation menu