Dynamic system methods for solving mixed linear matrix inequalities and linear vector inequalities and equalities
From MaRDI portal
Publication:972166
DOI10.1016/j.amc.2010.02.010zbMath1195.65079MaRDI 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
convergence; stability analysis; semidefinite programming; numerical examples; recurrent neural network; gradient flow; Runge-Kutta method; interior point methods; positive semidefinite matrices; dynamic system; matrix inequality system
65K05: Numerical mathematical programming methods
90C22: Semidefinite programming
90C20: Quadratic programming
90C05: Linear programming
90C51: Interior-point methods
15A39: Linear inequalities of matrices
Related Items
ZNN for solving online time-varying linear matrix-vector inequality via equality conversion, Zhang neural networks for a set of linear matrix inequalities with time-varying coefficient matrix
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
