An Algorithm to Globally Optimize The Robust Synthesis in L1
碩士 === 國立臺灣科技大學 === 工業管理系 === 92 === In this paper we provide a simple search algorithm to globally solve the bilinear problem from the robust synthesis in L1. Many authors discussed this problem before, but their methods still need to be improved. Hence, we use modified Hooke and Jeeves search with...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/18298126608689154822 |