Dynamic system methods for solving mixed linear matrix inequalities and linear vector inequalities and equalities

A novel idea is proposed for solving a system of mixed linear matrix inequalities and linear vector inequalities and equalities. First, the problem is converted into an unconstrained minimization problem with a continuously differentiable convex objective function. Then, a continuous-time dynamic system and a discrete-time dynamic system are proposed for solving it. Under some mild conditions, the proposed dynamic systems are shown to be globally convergent to a solution of the problem. The merits of the methods refer to their simple numerical implementations and capability for handling nonstrict LMIs easily. In addition, the methods are promising in neural circuits realization, and therefore have potential applications in many online control problems. Several numerical examples are presented to illustrate the performance of the methods and substantiate the theoretical results.

[1]  Xiaolin Hu,et al.  A Recurrent Neural Network for Solving a Class of General Variational Inequalities , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[2]  E. Yaz Linear Matrix Inequalities In System And Control Theory , 1998, Proceedings of the IEEE.

[3]  Shuzhi Sam Ge,et al.  A unified quadratic-programming-based dynamical system approach to joint torque optimization of physically constrained redundant manipulators , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[4]  A. Auslender Optimisation : méthodes numériques , 1976 .

[5]  Tianping Chen,et al.  Dynamical Behaviors of Delayed Neural Network Systems with Discontinuous Activation Functions , 2006, Neural Computation.

[6]  Xiaolin Hu,et al.  An Improved Dual Neural Network for Solving a Class of Quadratic Programming Problems and Its $k$-Winners-Take-All Application , 2008, IEEE Transactions on Neural Networks.

[7]  Chih-Chin Lai,et al.  A neural network for linear matrix inequality problems , 2000, IEEE Trans. Neural Networks Learn. Syst..

[8]  Jinde Cao,et al.  A delayed neural network for solving linear projection equations and its analysis , 2005, IEEE Transactions on Neural Networks.

[9]  Jun Wang,et al.  Recurrent neural networks for solving linear inequalities and equations , 1999 .

[10]  Jun Wang,et al.  A recurrent neural network for solving nonlinear convex programs subject to linear constraints , 2005, IEEE Transactions on Neural Networks.

[11]  L. Vandenberghe,et al.  Algorithms and software for LMI problems in control , 1997 .

[12]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[13]  Stephen P. Boyd,et al.  Linear Matrix Inequalities in Systems and Control Theory , 1994 .

[14]  J. Hopfield,et al.  Computing with neural circuits: a model. , 1986, Science.

[15]  Liqun Qi,et al.  A novel neural network for variational inequalities with linear and nonlinear constraints , 2005, IEEE Transactions on Neural Networks.

[16]  Yiguang Liu,et al.  A recurrent neural network computing the largest imaginary or real part of eigenvalues of real matrices , 2007, Comput. Math. Appl..

[17]  Yiguang Liu,et al.  A functional neural network computing some eigenvalues and eigenvectors of a special real matrix , 2005, Neural Networks.

[18]  Yan Fu,et al.  Neural networks based approach for computing eigenvectors and eigenvalues of symmetric matrix , 2004 .

[19]  F. Jarre An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices , 1993 .

[20]  Xiaolin Hu,et al.  A New Recurrent Neural Network for Solving Convex Quadratic Programming Problems With an Application to the $k$-Winners-Take-All Problem , 2009, IEEE Transactions on Neural Networks.

[21]  N. Higham COMPUTING A NEAREST SYMMETRIC POSITIVE SEMIDEFINITE MATRIX , 1988 .

[22]  Zheng Bao,et al.  A cross-associative neural network for SVD of non-squared data matrix in signal processing , 2001, IEEE Trans. Neural Networks.

[23]  Qingshan Liu,et al.  A One-Layer Recurrent Neural Network With a Discontinuous Hard-Limiting Activation Function for Quadratic Programming , 2008, IEEE Transactions on Neural Networks.

[24]  Yiguang Liu,et al.  A simple functional neural network for computing the largest and smallest eigenvalues and corresponding eigenvectors of a real symmetric matrix , 2005, Neurocomputing.

[25]  D. Kinderlehrer,et al.  An introduction to variational inequalities and their applications , 1980 .

[26]  Naum Zuselevich Shor,et al.  Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.

[27]  Tao Li,et al.  Further Results on Delay-Dependent Stability Criteria of Neural Networks With Time-Varying Delays , 2008, IEEE Transactions on Neural Networks.

[28]  Changyin Sun,et al.  Lmi-Based asymptotic Stability Analysis of Neural Networks with Time-Varying Delays , 2008, Int. J. Neural Syst..

[29]  Leon O. Chua,et al.  Neural networks for nonlinear programming , 1988 .

[30]  Arkadi Nemirovski,et al.  The projective method for solving linear matrix inequalities , 1997, Math. Program..

[31]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[32]  Xiaolin Hu,et al.  Solving Pseudomonotone Variational Inequalities and Pseudoconvex Optimization Problems Using the Projection Neural Network , 2006, IEEE Transactions on Neural Networks.