Main Page: Difference between revisions

From Cornell University Computational Optimization Open Textbook - Optimization Wiki
Jump to navigation Jump to search
VisualWikitext
No edit summary
No edit summary
Line 109: Line 109:
# [[Set covering problem]]
# [[Set covering problem]]
# [[Unit commitment problem]]
# [[Unit commitment problem]]
# [[Wing Shape Optimization]]
# [[Quadratic assignment problem]]
# [[Optimization in Game Theory]]
<br />
<br />


|<br />'''&nbsp;&nbsp;Emerging Applications'''
|<br />'''&nbsp;&nbsp;Emerging Applications'''
 
# [[Protein folding problem]]
 
 
# [[Facility location problem]]
# [[Traveling salesman problem]]
# [[Portfolio optimization]]
# [[Set covering problem]]
# [[Unit commitment problem]]
# [[Wing Shape Optimization]]
# [[Wing Shape Optimization]]
# [[Optimization in Game Theory]]
# [[Optimization in Game Theory]]
# [[Quantum computing for optimization]]
<br />
<br />
|}
|}

Revision as of 09:50, 30 August 2020

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.



Cornell Open Textbook on Computational Optimization


  Linear Programming (LP)
  1. Duality
  2. Computational complexity
  3. Network flow problem
  4. Interior-point method for LP
  5. Optimization with absolute values
  6. Matrix game (LP for game theory)
  Mixed-Integer Linear Programming (MILP)
  1. Mixed-integer cuts
  2. Disjunctive inequalities
  3. Lagrangean duality
  4. Column generation algorithms
  5. Heuristic algorithms
  6. Branch and cut
  7. Local branching
  8. Feasibility pump



  NonLinear Programming (NLP)
  1. Line search methods
  2. Trust-region methods
  3. Interior-point method for NLP
  4. Conjugate gradient methods
  5. Quasi-Newton methods
  6. Quadratic programming
  7. Sequential quadratic programming
  8. Subgradient optimization
  9. Mathematical programming with equilibrium constraints
  10. Dynamic optimization
  11. Geometric programming
  12. Nondifferentiable Optimization
  Mixed-Integer NonLinear Programming (MINLP)
  1. Signomial problems
  2. Mixed-integer linear fractional programming (MILFP)
  3. Convex Generalized disjunctive programming (GDP)
  4. Nonconvex Generalized disjunctive programming (GDP)
  5. Branch and bound (BB) for MINLP
  6. Branch and cut for MINLP
  7. Generalized Benders decomposition (GBD)
  8. Outer-approximation (OA)
  9. Extended cutting plane (ECP)



   Deterministic Global Optimization
  1. Exponential transformation
  2. Logarithmic transformation
  3. McCormick envelopes
  4. Piecewise linear approximation
  5. Spatial branch and bound method
  Optimization under Uncertainty
  1. Stochastic programming
  2. Chance-constraint method
  3. Fuzzy programming
  4. Classical robust optimization
  5. Distributionally robust optimization
  6. Adaptive robust optimization
  7. Data driven robust optimization




  Dynamic Programming
  1. Bellman equation
  2. Eight step procedures
  3. Stochastic dynamic programming
  Optimization for Machine Learning and Data Analytics
  1. Stochastic gradient descent
  2. Momentum
  3. AdaGrad
  4. RMSProp
  5. Adam
  6. Alternating direction method of multiplier (ADMM)
  7. Frank-Wolfe




  Traditional Applications
  1. Facility location problem
  2. Traveling salesman problem
  3. Portfolio optimization
  4. Set covering problem
  5. Unit commitment problem
  6. Quadratic assignment problem
  Emerging Applications
  1. Protein folding problem
  2. Wing Shape Optimization
  3. Optimization in Game Theory
  4. Quantum computing for optimization



Link

x

Retrieved from "https://optimization.cbe.cornell.edu/index.php?title=Main_Page&oldid=50"