課程目標

This course is divided into three major parts dealing with convex analysis, optimality conditions and duality, and computational methods. The ultimate goal in optimization studies is to develop efficient computational schemes for solving the problem at hand.

1. Convex analysis involves convex sets and convex functions and is central to the study of the field of optimization.

2. Optimality conditions and duality can be used not only to develop termination criteria but also to motivate and design the computational method itself.

3. To describe many computational methods (algorithms) for solving different classes of nonlinear programming problems.

本錄影課程為方述誠老師應邀授課，授課內容與課程大綱稍有不同。

課程章節

課程書目

課堂筆記

評分標準

本課程行事曆提供課程進度與考試資訊參考。