半正定规划

半正定规划（Semidefinite programming，SDP）是凸優化问题的一个分支，它具有线性目标函数（由用户指定的最大化或最小化函数），且其定义在半正定矩阵构成的锥体与仿射空间的交集上，即光谱面。

外部連結

Links to introductions and events in the field 页面存档备份，存于
Lecture notes from László Lovász 页面存档备份，存于 on Semidefinite Programming

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.