凸优化第五章对偶 作业题

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 

>>阅读原文<<