linear convex optimization

基本解释

The problem is reduced to a linear convex optimization algorithm via LMI approach.
採用線性矩陣不等式方法，將問題轉化爲一個線性凸優化算法。
This paper presents an interior trust region method for linear constrained LC convex optimization problems.
本文提出一種解線性約束凸槼劃的數值方法。
Using the linear matrix inequality (LMI) technique, the problem is converted into a linear convex optimization algorithm so that a global optimization solution is obtained. Finally.
採用線性矩陣不等式技術，將問題轉化爲一線性凸優化算法，可得問題的全侷最優解。