University of Melbourne
Many optimisation problems in the real world are inherently nonlinear. A variety of industries, including telecommunications networks, underground mining, microchip design, computer vision, facility location and supply chain management, depend on the efficient solution of nonlinear programs. This subject introduces the foundational mathematical concepts behind nonlinear optimisation. Some of the concepts covered include convex analysis, optimality conditions, conic programming, and duality. Various methods to solve nonlinear programs are covered, including iterative methods such as conjugate gradient methods, barrier methods and subgradient methods. This subject also explores the application of geometric methods such as perturbation and variational approaches to problems in facility location and network design.
📌 课程信息来源于 Melbourne University Handbook,选课建议为 AI 生成仅供参考。请以官方 Handbook 为准。
数据更新时间:2026 年 2 月 | WhiteMirror 不对信息准确性承担责任