凸優化第五章對偶 作業題

Lagrange對偶問題 The dual function provides a lower bound on the optimal value for convex optimization problems only. 對偶函數可以爲任意優化問題的最優值提供下界。 The dual function of an optimization problem evaluated at some 

>>阅读原文<<