subgradient

常見(jiàn)例句

• A modified subgradient algorithm is used to update the multipliers.
  而單水庫(kù)調(diào)度問(wèn)題可以通過(guò)優(yōu)化一系列單變 量函數(shù)來(lái)得到各個(gè)時(shí)刻水庫(kù)各運(yùn)行狀態(tài)的最優(yōu)發(fā)電放水量；
• Compath master problem is calculated by an improved subgradient method.
  利用改進(jìn)的次梯度算法求解主問(wèn)題。
• At the dual problem, an adaptive step sizing subgradient method is applied to maximize the dual function.
  本文涉及的工作是國(guó)家杰出青年科學(xué)基金項(xiàng)目“大型電力系統(tǒng)的優(yōu)化調(diào)度” 的一部分，同時(shí)受到美國(guó)李氏基金的資助，主要研究基于Lagrangian對(duì)偶原理、網(wǎng)絡(luò)流算法、動(dòng)態(tài)規(guī)劃以及基因算法的電力系統(tǒng)優(yōu)化調(diào)度次優(yōu)調(diào)度解求解方法，著重研究考慮各種約束的梯級(jí)水電系統(tǒng)的調(diào)度方法。
• Because of the difficulty and complexity of the optimization problem, we adopt Lagrangean Relaxation and the subgradient method.
  由于該問(wèn)題的復(fù)雜性與困難度，我們采用拉格蘭日松弛法作為我們的解題方法。
• This method is then applied in the traveling salesman problem, and the results show that this method leads to significant improvement over the traditional subgradient algorithm.
  最后通過(guò)仿真實(shí)驗(yàn)驗(yàn)證了該方法的有效性。
• This paper introduces a new dual problem for multiobjective programming in sub differential, proves its weak, strong and inverse duality, obtains a new subgradient and esta blishes another new dual problem.
  本文利用次微分建立了多目標(biāo)規(guī)劃的一個(gè)新的對(duì)偶問(wèn)題 ,并給出其弱、強(qiáng)和逆對(duì)偶性 ,得到了一個(gè)新的次梯度的定義 ,并用其建立了一個(gè)新的對(duì)偶問(wèn)題
返回 subgradient