SDP 算法（半定规划松弛法）

SDP算法（半定规划松弛法）是一种用于求解二次优化问题的方法。它使用半正定松弛来将原始的离散问题转化为半定规划问题。引用中提到了一种基于块坐标下降方法的SDP求解算法，旨在降低计算复杂度。此外，引用和引用提供了一些经典著作和博客文章，可供进一步了解SDP算法的详细细节和示例代码。<span class="em">1</span><span class="em">2</span><span class="em">3</span>
#### 引用[.reference_title]
- *1* [SDP半正定规划的低复杂度求解：基于块坐标下降（Block Coordinate Descent）](https://blog.csdn.net/weixin_39274659/article/details/121834231)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT3_1"}}] [.reference_item style="max-width: 33.333333333333336%"]
- *2* [经典的SDR算法： 用半正定松弛法 ( Semidefinite Relaxation) 求解二次优化问题](https://blog.csdn.net/shixin_0125/article/details/125117466)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT3_1"}}] [.reference_item style="max-width: 33.333333333333336%"]
- *3* [半正定松弛法（SDR）2021-11-06](https://blog.csdn.net/weixin_44655342/article/details/121175761)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT3_1"}}] [.reference_item style="max-width: 33.333333333333336%"]
[ .reference_list ]