Dynamic system methods for solving mixed linear matrix inequalities and linear vector inequalities and equalities
DOI10.1016/j.amc.2010.02.010zbMath1195.65079OpenAlexW2016310529MaRDI QIDQ972166
Publication date: 25 May 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.02.010
convergencestability analysissemidefinite programmingnumerical examplesrecurrent neural networkgradient flowRunge-Kutta methodinterior point methodspositive semidefinite matricesdynamic systemmatrix inequality system
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Quadratic programming (90C20) Linear programming (90C05) Interior-point methods (90C51) Linear inequalities of matrices (15A39)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing a nearest symmetric positive semidefinite matrix
- Neural networks based approach for computing eigenvectors and eigenvalues of symmetric matrix
- A recurrent neural network computing the largest imaginary or real part of eigenvalues of real matrices
- A functional neural network computing some eigenvalues and eigenvectors of a special real matrix
- Collective Computation With Continuous Variables
- An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
- Linear Matrix Inequalities in System and Control Theory
- Recurrent neural networks for solving linear inequalities and equations
- Semidefinite Programming
- Dynamical Behaviors of Delayed Neural Network Systems with Discontinuous Activation Functions
This page was built for publication: Dynamic system methods for solving mixed linear matrix inequalities and linear vector inequalities and equalities
