该参考描述所示目录。请向院校确认当前的招生项目及适用于您入学年的条件。
描述
连续优化 非线性优化中的问题与方法。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