Convergence and stability of the Newton-Like algorithm with estimation error in optimization flow control

The Newton-Like algorithm with price estimation error in optimization flow control in network is analyzed. The estimation error is treated as inexactness of the gradient and the inexact descent direction is analyzed. Based on the optimization theory, a sufficient condition for convergence of this algorithm with bounded price estimation error is obtained. Furthermore, even when this sufficient condition doesn＇t hold, this algorithm can also converge, provided a modified step size, and an attraction region is obtained. Based on Lasalle＇s invariance principle applied to a suitable Lyapunov function, the dynamic system described by this algorithm is proved to be global stability if the error is zero. And the Newton-Like algorithm with bounded price estimation error is also globally stable if the error satisfies the sufficient condition for convergence. All trajectories ultimately converge to the equilibrium point.

New results on the robust stability analysis of neural networks with discrete and distributed time delays

Delay-dependent robust stability of cellular neural networks with time-varying discrete and distributed time-varying delays is considered. Based on Lyapunov stability theory and the linear matrix inequality （LMIs） technique, delay-dependent stability criteria are derived in terms of LMIs avoiding bounding certain cross terms, which often leads to conservatism. The effectiveness of the proposed stability criteria and the improvement over the existing results are illustrated in the numerical examples.

Revenue-sharing contract to coordinate independent participants within the supply chain

To improve the performance of the supply chain with one supplier and multiple retailers under deterministic price-sensitive customer demand, an optimal strategy is proposed based on knowledge discovery. First the decentralized system in which the supplier and the retailers are independent, profit-maximizing participants with the supplier acting as a Stackelberg game leader is studied. Numerical examples illustrate the importance of the coordination. The conventional quantity discount mechanism needs to be modified to coordinate the supply chain, so a revenue-sharing contract is proposed to coordinate such supply chain. Lastly, a special decision under certain demand rates is studied. The pricing and replenishment policies can be decided sequentially, which yields much less loss comparing with optimal decision when the demand rates are sufficiently large.

HF radar sea clutter rejection by nonlinear projections

In the background of signal detection for high frequency （I/F） radar, the sea clutter is quite significant and can mask some weak target signals. A new clutter rejection method named “nonlinear projection” is given to improve the SNR of the target. This approach is based on the recent observation that HF sea clutter may be modeled as a nonlinear deterministic dynamical system. After approximating the multidimensional reconstruction of the clutter by a low-dimensional attractor, projections onto this attractor can separate the clutter from other components. Real sea clutter, simulated target data and real target data are used to show that a nonlinear clutter rejection method is a promising technique to suppress sea clutter and enhances target detection.

End-to-end rate-based congestion control with random loss:convergence and stability

The convergence and stability analysis for two end-to-end rate-based congestion control algorithms with unavoidable random loss in packets are presented, which can be caused by, for example, errors on wireless links. The convergence rates of these two algorithms are analyzed by linearizing them around their equilibrium points, since they are globally stable and can converge to their unique equilibrium points. Some sufficient conditions for local stability in the presence of round-trip delay are obtained based on the general Nyquist criterion of stability. The stability conditions can be considered to be more general. If random loss in the first congestion control algorithm is not considered, they reduce to the local stability conditions which have been obtained in some literatures. Furthermore, sufficient conditions for local stability of a new congestion control algorithm have also been obtained if random loss is not considered in the second congestion control algorithm.

Exponential stability for cellular neural networks: an LMI approach

A new sufficient conditions for the global exponential stability of the equilibrium point for delayed cellular neural networks （DCNNs） is presented. It is shown that the use of a more general type of Lyapunov-Krasovskii function enables the derivation of new results for an exponential stability of the equilibrium point for DCNNs. The results establish a relation between the delay time and the parameters of the network. The results are also compared with one of the most recent results derived in the literature.

Non-fragile decentralized H_∞ controller design for uncertain linear systems

Considering the design problem of non-fragile decentralized H∞ controller with gain variations, the dynamic feedback controller by measurement feedback for uncertain linear systems is constructed and studied. The parameter uncertainties are considered to be unknown but norm bounded. The design procedures are investigated in terms of positive definite solutions to modify algebraic Riccati inequalities. Using information exchange among local controllers, the designed non-fragile decentralized H∞ controllers guarantee that the uncertain closed-loop linear systems are stable and with H∞ -norm bound on disturbance attenuation. A sufficient condition that there are such non-fragile H∞ controllers is obtained by algebraic Riccati inequalities. The approaches to solve modified algebraic Riccati inequalities are carried out preliminarily. Finally, a numerical example to show the validity of the proposed approach is given.

Stability and guaranteed cost control for uncertain time-delay Lur'e systems

The problem of delay-dependent stability and guaranteed cost control （GCC） for a class of uncertain time-delay Lur＇e systems are studied. By using an improved integral inequality,a less conservative delay-dependent stability criterion is formulated as the feasibility problem of the linear matrix inequality （LMI）. The criterion is proved theoretically to be less conservative than some existing results for linear time-delay systems. Because of the fact that the matrices in the LMI-based stability criteria usually have different dimensions, different structures, and different variables, the conservatism analysis of the criteria is difficult. This study brings about a new insight into the comparison of conservatism among different stability criteria, which are expressed in certain LMI forms. The existence of the guaranteed cost controller is given in terms of matrix inequalities. The condition can be solved by using an iterative procedure and does not need any parameter tuning. A numerical example is given to illustrate the effectiveness of the proposed method.

Simultaneous quadratic performance stabilization for linear time-delay systems

A newly designed approach of simultaneous stabilization is given for linear discrete time-delay systems. The problem of stabilization for a collection of systems is discussed initially. Adequate condition are obtained in terms of linear matrix inequalities （LMIs） which are independent of time delays such that the resultant collection of discrete time-delay systems are stable with an upper bound of the quadratic performance index. Subsequently, controllers are designed such that the resultant closed-loop discrete time-delay systems are simultaneously stabilized with the upper bound of the quadratic performance index. Finally,a numerical example is given to illustrate the design method.