विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| कॉलम जनरेशन (डैन्ट्ज़िग-वोल्फ़)× | ऑग्मेंटेड लैग्रेंजियन विधि× | |
|---|---|---|
| क्षेत्र | संचालन अनुसंधान | संचालन अनुसंधान |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 1960 | 1969 |
| प्रवर्तक≠ | George B. Dantzig and Philip Wolfe | Magnus R. Hestenes and M. J. D. Powell |
| प्रकार | algorithm | algorithm |
| मौलिक स्रोत≠ | Dantzig, G. B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8(1), 101-111. DOI ↗ | Hestenes, M. R. (1969). Multiplier and gradient methods. Journal of Optimization Theory and Applications, 4(5), 303-320. DOI ↗ |
| उपनाम≠ | Dantzig-Wolfe decomposition, column generation method | method of multipliers, augmented Lagrangian, ADMM |
| संबंधित | 3 | 3 |
| सारांश≠ | 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. | 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. |
| ScholarGateडेटासेट ↗ |
|
|