convex optimization

常見(jiàn)例句

Converting the convex optimization question to simple one dimension search, we get the effective method to settle the optimal weight coefficient.
通過(guò)轉(zhuǎn)換該凸最優(yōu)的約束方程爲(wèi)簡(jiǎn)單的一維搜索，提出了最優(yōu)加權(quán)系數(shù)的有傚求解方法。
This paper discusses problems arising in system and control theory to a few standard convex optimization problems involving linear matrix inequality(LMI).
本文研究了出現(xiàn)在系統(tǒng)與控制理論中的一些標(biāo)準(zhǔn)的、包含線性矩陣不等式的凸優(yōu)化問(wèn)題。
But if you know it's a differentiation problem or a convex optimization problem or a boolean logic problem then you at least know where to start looking for the solution.
但如果你知道這是個(gè)變異的問(wèn)題，或者是一個(gè)凸優(yōu)化問(wèn)題，或者一個(gè)佈爾的邏輯問(wèn)題，然後你起碼能知道從哪著手開始尋找解決方案。