ScholarGate
Assistent

Methoden vergleichen

Prüfen Sie die ausgewählten Methoden nebeneinander; abweichende Zeilen sind hervorgehoben.

Robuste Optimierung – Worst-Case Mathematische Programmierung×Konvexe Optimierung×
FachgebietOptimierungOptimierung
FamilieProcess / pipelineProcess / pipeline
Entstehungsjahr1970s theoretical roots; modern tractable form from late 1990s–20042004
UrheberBen-Tal, El Ghaoui & Nemirovski (seminal book, 2009); Bertsimas & Sim (tractable polyhedral formulation, 2004)Stephen Boyd & Lieven Vandenberghe
TypMathematical programming frameworkMathematical optimization framework
Wegweisende QuelleBen-Tal, A., El Ghaoui, L. & Nemirovski, A. (2009). Robust Optimization. Princeton University Press. ISBN: 9780691143682Boyd, S., & Vandenberghe, L. (2004). Convex Optimization. Cambridge University Press. ISBN: 978-0-521-83378-3
Aliasnamenminimax optimization, worst-case optimization, Gürbüz Optimizasyon (Robust Optimization)Convex Programming, Disciplined Convex Programming, Dışbükey Optimizasyon, Convex Mathematical Programming
Verwandt53
ZusammenfassungRobust optimization is a mathematical programming framework, formalised by Ben-Tal and Nemirovski in the late 1990s and made broadly tractable by Bertsimas and Sim (2004), that finds decisions guaranteed to perform acceptably under every scenario within a predefined uncertainty set — rather than assuming parameter values are known exactly. Instead of optimising for a single expected outcome, it minimises the worst-case objective across all plausible realisations of uncertain data.Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets. Formalized and popularized by Stephen Boyd and Lieven Vandenberghe in their landmark 2004 textbook, the framework unifies a wide family of problems — including linear programming, quadratic programming, semidefinite programming, and second-order cone programming — under a single theoretical roof. Its defining property is that any locally optimal solution is also globally optimal, making it tractable and reliable for engineering, statistics, machine learning, and operations research.
ScholarGateDatensatz
  1. v1
  2. 2 Quellen
  3. PUBLISHED
  1. v1
  2. 1 Quellen
  3. PUBLISHED

Zur Suche Folien herunterladen

ScholarGateMethoden vergleichen: Robust Optimization · Convex Optimization. Abgerufen am 2026-06-15 von https://scholargate.app/de/compare