Useful Links
Systems Science
Optimization Theory
1. Foundations of Optimization
2. Mathematical Foundations
3. Unconstrained Optimization
4. Constrained Optimization Theory
5. Linear Programming
6. Nonlinear Programming
7. Integer and Combinatorial Optimization
8. Dynamic Programming
9. Stochastic Optimization
10. Heuristic and Metaheuristic Methods
11. Multi-Objective Optimization
12. Specialized Optimization Topics
13. Applications and Case Studies
14. Computational Aspects and Software
Specialized Optimization Topics
Convex Optimization
Conic Programming
Linear Programming as Conic
Second-Order Cone Programming
Semidefinite Programming
Interior Point Methods for Convex Problems
Proximal Methods
Proximal Gradient Method
Accelerated Proximal Methods
Dual Methods
Dual Ascent
Dual Decomposition
ADMM Applications
Network Optimization
Shortest Path Problems
Dijkstra's Algorithm
Bellman-Ford Algorithm
Floyd-Warshall Algorithm
Maximum Flow Problems
Ford-Fulkerson Algorithm
Push-Relabel Algorithms
Minimum Cost Flow Problems
Network Design Problems
Game Theory and Optimization
Nash Equilibrium
Stackelberg Games
Cooperative Game Theory
Mechanism Design
Variational Methods
Calculus of Variations
Optimal Control Theory
Pontryagin's Maximum Principle
Hamilton-Jacobi-Bellman Equation
Previous
11. Multi-Objective Optimization
Go to top
Next
13. Applications and Case Studies