ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

روش لاگرانژین افزوده×تولید ستون (دانتزیگ-ولف)×
حوزهپژوهش عملیاتپژوهش عملیات
خانوادهMachine learningMachine learning
سال پیدایش19691960
پدیدآورMagnus R. Hestenes and M. J. D. PowellGeorge B. Dantzig and Philip Wolfe
نوعalgorithmalgorithm
منبع بنیادین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 ↗
نام‌های دیگرmethod of multipliers, augmented Lagrangian, ADMMDantzig-Wolfe decomposition, column generation method
مرتبط33
خلاصه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.
ScholarGateمجموعه‌داده
  1. v1
  2. 3 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED

رفتن به جست‌وجو دریافت اسلایدها

ScholarGateمقایسهٔ روش‌ها: Augmented Lagrangian Method · Column Generation (Dantzig-Wolfe). بازیابی‌شده در 2026-06-15 از https://scholargate.app/fa/compare