此參考說明所註明的目錄。請向該機構確認當前課程供給與適用於你入學的條件。
課程說明
連續最佳化 非線性最佳化之問題與方法。R^{n} 中之傳統最佳化：不等式約束、拉格朗日、對偶性、凸性。非線性規劃。無約束最佳化之搜尋法。無約束最佳化之梯度法。有約束最佳化。動態規劃。講課，每週3小時；實驗/導修，每週1小時。先修科目：MATH 2P03 或授課教師許可。註：本課程可能以多種授課模式提供。授課方式將在學期課程時刻表中列示於相應學期。
先修條件
- 先修科目：MATH 2P03 或授課教師許可。
條件與方式
- 先修科目：MATH 2P03 或授課教師許可。
- 注意：此課程可能以多種授課方式開設。授課方式將在適用學期的學術時刻表中列出。
原文參考文本
Continuous Optimization Problems and methods in non-linear optimization. Classical optimization in R^{n}: inequality constraints, Lagrangian, duality, convexity. Non-linear programming. Search methods for unconstrained optimization. Gradient methods for unconstrained optimization. Constrained optimization. Dynamic programming. Lectures, 3 hours per week; lab/tutorial, 1 hour per week. Prerequisite(s): MATH 2P03 or permission of the instructor. Note: this course may be offered in multiple modes of delivery. The method of delivery will be listed on the academic timetable, in the applicable term.
- Prerequisite(s): MATH 2P03 or permission of the instructor.
- Note: this course may be offered in multiple modes of delivery. The method of delivery will be listed on the academic timetable, in the applicable term.
來源與參考
保留日期與來源以協助你核實資料。為便於閱讀提供譯文；官方來源為條件與要求的參照。
來源參考 : https://brocku.ca/webcal/2024/undergrad/math.html