文件名称：SDP(semi-definite programming).pdf
文件大小：465KB
文件格式：PDF
更新时间：2023-01-30 05:38:23
凸优化 半正定优化
Semidefinite programming (SDP) is the most exciting development in mathematical programming in the 1990’s. SDP has applications in such diverse fields as traditional convex constrained optimization, control theory, and combinatorial optimization. Because SDP is solvable via interior point methods, most of these applications can usually be solved very efficiently in practice as well as in theory.