Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Metoda Simplex× | Metoda zaugmentowanego Lagrangianu× | |
|---|---|---|
| Dziedzina | Badania operacyjne | Badania operacyjne |
| Rodzina | Machine learning | Machine learning |
| Rok powstania≠ | 1947 | 1969 |
| Twórca≠ | George Dantzig | Magnus R. Hestenes and M. J. D. Powell |
| Typ | algorithm | algorithm |
| Źródło pierwotne≠ | Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press. DOI ↗ | Hestenes, M. R. (1969). Multiplier and gradient methods. Journal of Optimization Theory and Applications, 4(5), 303-320. DOI ↗ |
| Inne nazwy≠ | simplex algorithm | method of multipliers, augmented Lagrangian, ADMM |
| Pokrewne≠ | 4 | 3 |
| Podsumowanie≠ | The Simplex Method, developed by George Dantzig in 1947, is a foundational algorithm for solving linear programming problems. It systematically explores vertices of the feasible region to find the optimal solution where the objective function is maximized or minimized subject to linear constraints. | The Augmented Lagrangian Method, developed by Magnus R. Hestenes and M. J. D. Powell in 1969, is a powerful technique for solving constrained optimization problems. It converts a constrained problem into a sequence of unconstrained subproblems by augmenting the Lagrangian with a quadratic penalty term, enabling efficient solution of large-scale problems including convex and nonconvex cases. |
| ScholarGateZbiór danych ↗ |
|
|