Short pages

Showing below up to 50 results in range #1 to #50.

1. (hist) Lion algorithm [27 bytes]
2. (hist) Bellman equation [498 bytes]
3. (hist) New Topics in Fall 2024 [559 bytes]
4. (hist) About [1,066 bytes]
5. (hist) Quantum computing for optimization [1,713 bytes]
6. (hist) 2020 Cornell Optimization Open Textbook Feedback [3,934 bytes]
7. (hist) Classical robust optimization [4,435 bytes]
8. (hist) 2024 Cornell Optimization Open Textbook Feedback [5,768 bytes]
9. (hist) Extended cutting plane (ECP) [7,009 bytes]
10. (hist) 2021 Cornell Optimization Open Textbook Feedback [7,303 bytes]
11. (hist) Subgradient optimization [8,079 bytes]
12. (hist) Main Page [8,521 bytes]
13. (hist) McCormick envelopes [10,342 bytes]
14. (hist) Convex generalized disjunctive programming (GDP) [10,386 bytes]
15. (hist) Branch and cut [11,260 bytes]
16. (hist) RMSProp [11,338 bytes]
17. (hist) Nondifferentiable Optimization [11,436 bytes]
18. (hist) Adamax [11,533 bytes]
19. (hist) Portfolio optimization [11,985 bytes]
20. (hist) Dynamic optimization [12,308 bytes]
21. (hist) Geometric programming [12,366 bytes]
22. (hist) Branch and bound for MINLP [12,507 bytes]
23. (hist) Branch and bound (BB) for MINLP [12,560 bytes]
24. (hist) Simulated annealing [12,659 bytes]
25. (hist) Fuzzy programming [12,701 bytes]
26. (hist) Adam [12,774 bytes]
27. (hist) Mixed-integer cuts [13,066 bytes]
28. (hist) Branch and cut for MINLP [13,073 bytes]
29. (hist) Data driven robust optimization [13,101 bytes]
30. (hist) Unit commitment problem [13,249 bytes]
31. (hist) Piecewise linear approximation [13,616 bytes]
32. (hist) Exponential transformation [13,814 bytes]
33. (hist) Sequential quadratic programming [14,076 bytes]
34. (hist) Newsvendor problem [14,234 bytes]
35. (hist) Momentum [14,389 bytes]
36. (hist) AdamW [14,597 bytes]
37. (hist) Logarithmic transformation [14,601 bytes]
38. (hist) Disjunctive inequalities [14,832 bytes]
39. (hist) Duality [15,224 bytes]
40. (hist) Differential evolution [15,293 bytes]
41. (hist) Spatial branch and bound method [15,595 bytes]
42. (hist) Interior-point method for LP [15,602 bytes]
43. (hist) LossScaleOptimizer [15,836 bytes]
44. (hist) Evolutionary multimodal optimization [15,861 bytes]
45. (hist) Simplex algorithm [15,987 bytes]
46. (hist) Signomial problems [16,145 bytes]
47. (hist) Stochastic gradient descent [16,327 bytes]
48. (hist) Heuristic algorithms [16,405 bytes]
49. (hist) Local branching [16,417 bytes]
50. (hist) Matrix game (LP for game theory) [16,769 bytes]