linear convex optimization

基本解釋

The problem is reduced to a linear convex optimization algorithm via LMI approach.
采用線性矩陣不等式方法，將問(wèn)題轉(zhuǎn)化為一個(gè)線性凸優(yōu)化算法。
This paper presents an interior trust region method for linear constrained LC convex optimization problems.
本文提出一種解線性約束凸規(guī)劃的數(shù)值方法。
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.
采用線性矩陣不等式技術(shù)，將問(wèn)題轉(zhuǎn)化為一線性凸優(yōu)化算法，可得問(wèn)題的全局最優(yōu)解。