［V］、［V^（－1）］极小化的快速算法

A Rapid Method to Minimize б[V]、б[V-1]

在极点配置的约束下，讨论时域鲁棒设计的一种方法，归结为σ［Ｖ］、σ［Ｖ－１］（条件数）的极小化所涉及的快速算法问题。本文通过区间，步长等的自动寻优，特别是把最速下降法与共轭梯度法有机地结合到一起去寻优，从而提高了其收敛速度，同时兼顾指标的适用范围，实例说明。

By the way of Combining optimization gradient method and conjugate gradient method, the automatic optimization seeking was realized which improved the convergent speed and also considered the application range of indexes. The example showed that the method was effective.