《Convex Optimization》notes 1 — Introduction | 私立大學五星教授網

This book is about convex optimization, a special class of mathematical optimiza- tion problems, which includes least-squares and linear programming ...

動態規劃有一個技巧是：最佳解位於直線們的包絡線，經過點線對偶，最佳解位於凸包切線的截距。正是此對偶。

2019年1月2日 — 對於所有的Convex optimization problem，最重要的特性就是「局部最優值必定等於全局最優值」，意思是如果你已經在某一個小塊區域找到最優值的話，那恭喜你， ...

由 S Boyd 著作 · 被引用 77494 次 — A MOOC on convex optimization, CVX101, was run from 1/21/14 to 3/14/14. If you register for it, you can access all the course materials.

Convex Optimization: Fall 2019 Machine Learning 10-725 Instructor: Ryan Tibshirani (ryantibs at cmu dot edu)

由 S Boyd 著作 · 2004 · 被引用 77494 次 — The book begins with the basic elements of convex sets and functions, and then describes various classes of convex optimization problems. Duality and ...

A convex optimization problem is a problem where all of the constraints are convex functions, and the objective is a convex function if minimizing, or a concave ...