In this paper, the problem of decentralized observation and decentralized control of linear, time-invariant large scale systems is studied. Based on conventional observer theory, the necessary and sufficient condition...In this paper, the problem of decentralized observation and decentralized control of linear, time-invariant large scale systems is studied. Based on conventional observer theory, the necessary and sufficient conditions for existence of completely decentralized observer are obtained. Moreover, the necessary and sufficient condition is given for stabilization of large scale systems by local output with state of the subsystem estimated through the completely decentralized observer.展开更多
A new limited memory symmetric rank one algorithm is proposed. It combines a modified self-scaled symmetric rank one （SSR1） update with the limited memory and nonmonotone line search technique. In this algorithm, th...A new limited memory symmetric rank one algorithm is proposed. It combines a modified self-scaled symmetric rank one （SSR1） update with the limited memory and nonmonotone line search technique. In this algorithm, the descent search direction is generated by inverse limited memory SSR1 update, thus simplifying the computation. Numerical comparison of the algorithm and the famous limited memory BFGS algorithm is given. Comparison results indicate that the new algorithm can process a kind of large-scale unconstrained optimization problems.展开更多
文摘In this paper, the problem of decentralized observation and decentralized control of linear, time-invariant large scale systems is studied. Based on conventional observer theory, the necessary and sufficient conditions for existence of completely decentralized observer are obtained. Moreover, the necessary and sufficient condition is given for stabilization of large scale systems by local output with state of the subsystem estimated through the completely decentralized observer.
基金the National Natural Science Foundation of China(10471062)the Natural Science Foundation of Jiangsu Province(BK2006184)~~
文摘A new limited memory symmetric rank one algorithm is proposed. It combines a modified self-scaled symmetric rank one （SSR1） update with the limited memory and nonmonotone line search technique. In this algorithm, the descent search direction is generated by inverse limited memory SSR1 update, thus simplifying the computation. Numerical comparison of the algorithm and the famous limited memory BFGS algorithm is given. Comparison results indicate that the new algorithm can process a kind of large-scale unconstrained optimization problems.
