نتایج جستجو برای: linear matrix inequalities lmi

تعداد نتایج: 844179  

Journal: :Fractal and fractional 2022

In this paper, the synchronization of fractional-order uncertain delayed neural networks with an event-triggered communication scheme is investigated. By establishing a suitable Lyapunov–Krasovskii functional (LKF) and inequality techniques, sufficient conditions are obtained under which stable. The criteria given in terms linear matrix inequalities (LMIs). Based on drive–response concept, LMI ...

Journal: :IFAC-PapersOnLine 2021

In a recent paper we have shown that data collected from linear systems excited by persistently exciting inputs during low-complexity experiments, can be used to design state- and output-feedback controllers, including optimal Linear Quadratic Regulators (LQR), solving matrix inequalities (LMI) semidefinite programs. We also how stabilize in the first approximation unknown nonlinear using data....

2005
Tsuyoshi KIYAMA Takumi SAKAMOTO

This paper proves that a certain class of nonconvex matrix inequalities is equivalent to linear matrix inequalities (LMIs) plus a nonconvex rank constraint. From the equivalence, this paper proposes two heuristic algorithms, that is extended linearization algorithms, to solve LMIs with a rank constraint using LMI-based approach. Reliability and efficiency of the algorithms are investigated stat...

D Behmardi, E Taghizadeh, M Matin Far, Y Ordokhani,

In this paper, a class of linear systems with multiple time delays is studied. The problem of exponential stability of time-delay systems has been investigated by using Lyapunov functional method. We will convert the system of multiple time delays into a single time delay system and show that if the old system is stable then the new one is so. Then we investigate the stability of converted new ...

Journal: :IEEE Trans. Automat. Contr. 2000
Pierre Apkarian Hoang Duong Tuan

This paper is concerned with the robust control problem of LFT (Linear Fractional Representation) uncertain systems depending on a time-varying parameter uncertainty. Our main result exploits an LMI (Linear Matrix Inequality) characterization involving scalings and Lya-punov variables subject to an additional essentially non-convex algebraic constraint. The non-convexity enters the problem in t...

2008
Wei-Wei Su Yi-Ming Chen

⎯By employing the Lyapunov stability theory and linear matrix inequality (LMI) technique, delaydependent stability criterion is derived to ensure the exponential stability of bi-directional associative memory (BAM) neural networks with time-varying delays. The proposed condition can be checked easily by LMI control toolbox in Matlab. A numerical example is given to demonstrate the effectiveness...

In this note‎, ‎we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique‎. ‎Our results are similar to some inequalities shown by Bhatia and Kittaneh in [Linear Algebra Appl‎. ‎308 (2000) 203-211] and [Linear Algebra Appl‎. ‎428 (2008) 2177-2191]‎.

Journal: :IEEE Access 2022

The exponential stability of semi-linear stochastic partial differential equations (SPDEs) involving L&#x00E8;vy type noise is investigated in this paper. By constructing an appropriate Lyapunov function, a new set sufficient conditions are established terms linear matrix inequalities (LMIs) which ensures the mean-square exponentially (MSES) given system with Neumann boundary conditions. Then <...

Journal: :Math. Program. 2010
J. William Helton Jiawang Nie

Let S = {x ∈ R : g1(x) ≥ 0, · · · , gm(x) ≥ 0} be a semialgebraic set defined by multivariate polynomials gi(x). Assume S is convex, compact and has nonempty interior. Let Si = {x ∈ R : gi(x) ≥ 0}, and ∂S (resp. ∂Si) be the boundary of S (resp. Si). This paper, as does the subject of semidefinite programming (SDP), concerns Linear Matrix Inequalities (LMIs). The set S is said to have an LMI rep...

2007
J William Helton Jiawang Nie

Let S = {x ∈ R n : g 1 (x) ≥ 0, · · · , gm(x) ≥ 0} be a semialgebraic set defined by multivariate polynomials g i (x). Assume S is convex, compact and has nonempty interior. Let S i = {x ∈ R n : g i (x) ≥ 0} and ∂S i = {x ∈ R n : g i (x) = 0} be its boundary. This paper, as does the subject of semidefinite programming (SDP), concerns Linear Matrix Inequalities (LMIs). The set S is said to have ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید