方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 非线性规划× | 鲁棒优化× | |
|---|---|---|
| 领域 | 优化 | 优化 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 2006 | 1970s theoretical roots; modern tractable form from late 1990s–2004 |
| 提出者≠ | Jorge Nocedal & Stephen Wright | Ben-Tal, El Ghaoui & Nemirovski (seminal book, 2009); Bertsimas & Sim (tractable polyhedral formulation, 2004) |
| 类型≠ | Continuous mathematical optimization | Mathematical programming framework |
| 开创性文献≠ | Nocedal, J., & Wright, S. J. (2006). Numerical Optimization (2nd ed.). Springer. ISBN: 978-0-387-30303-1 | Ben-Tal, A., El Ghaoui, L. & Nemirovski, A. (2009). Robust Optimization. Princeton University Press. ISBN: 9780691143682 |
| 别名≠ | NLP optimization, Constrained nonlinear optimization, Smooth optimization, Doğrusal olmayan programlama | minimax optimization, worst-case optimization, Gürbüz Optimizasyon (Robust Optimization) |
| 相关≠ | 3 | 5 |
| 摘要≠ | Nonlinear programming (NLP) is a branch of mathematical optimization concerned with problems in which the objective function or at least one constraint is nonlinear. Formalized comprehensively by Jorge Nocedal and Stephen Wright in their seminal 2006 text, NLP encompasses gradient-based algorithms — including sequential quadratic programming (SQP), interior-point methods, and quasi-Newton approaches — for finding locally or globally optimal solutions to continuous decision problems arising across engineering, economics, and the physical sciences. | Robust 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. |
| ScholarGate数据集 ↗ |
|
|