Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Augmented Lagrangian Method× | Kolumngenerering (Dantzig-Wolfe)× | |
|---|---|---|
| Ämnesområde | Operationsanalys | Operationsanalys |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 1969 | 1960 |
| Upphovsperson≠ | Magnus R. Hestenes and M. J. D. Powell | George B. Dantzig and Philip Wolfe |
| Typ | algorithm | algorithm |
| Ursprungskälla≠ | Hestenes, M. R. (1969). Multiplier and gradient methods. Journal of Optimization Theory and Applications, 4(5), 303-320. DOI ↗ | Dantzig, G. B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8(1), 101-111. DOI ↗ |
| Alias≠ | method of multipliers, augmented Lagrangian, ADMM | Dantzig-Wolfe decomposition, column generation method |
| Närliggande | 3 | 3 |
| Sammanfattning≠ | 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. | Column Generation, developed by George B. Dantzig and Philip Wolfe in 1960, is a powerful optimization technique for solving large-scale linear programming problems with special structure. Also known as Dantzig-Wolfe Decomposition, it decomposes the problem into a master problem (restricted to a subset of variables/columns) and a pricing subproblem (identifying new variables), iteratively improving the solution by introducing only relevant columns. |
| ScholarGateDatamängd ↗ |
|
|