Farkas’ lemma is a fundamental result from linear programming providing linear certificates for infeasibility of systems of linear inequalities. In semidefinite programming, such linear certificates only exist for strongly infeasible linear matrix inequalities. We provide nonlinear algebraic certificates for all infeasible linear matrix inequalities in the spirit of real algebraic geometry. Mor...

This paper considers the robust fault detection and isolation (FDI) problem for uncertain linear timeinvariant (LTI) systems. An FDI filter minimizes the sensitivity of the residual signal to disturbances and modeling errors subject to the constraint that the transfer matrix function from the faults to the residual is close to a diagonal matrix (for fault isolation). A solution of the optimizat...

This paper presents a novel approach for the controller synthesis in discrete-time linear systems (DTLS) with uncertainty polytopical type, by means of the extended static feedback of the measured output. The method consists of designing feedback gains for the injection of the output and its derivative, which corresponds to the control signal. Conditions for the existence of such controllers ar...

Linear matrix inequalities (LMIs) prove to be a useful tool for solving several analysis and design problems in linear systems control. However, LMI techniques have mainly been used conjointly with state-space methods. The aim of this paper is to survey several recent achievements that tend to prove that LMI feasibility and optimization problems also arise when dealing with control problems for...

This paper introduces to constructing problems of convex relaxations for nonconvex polynomial optimization problems. Branch-and-bound algorithms are convex relaxation based. The convex envelopes are of primary importance since they represent the uniformly best convex underestimators for nonconvex polynomials over some region. The reformulationlinearization technique (RLT) generates LP (linear p...

In this paper, we consider the problems of stability analysis and control synthesis for first-order hyperbolic linear Partial Differential Equations (PDEs) over a bounded interval with spatially varying coefficients. We propose Linear Matrix Inequalities (LMI) conditions for the stability and for the design of boundary and distributed control for the system. These conditions involve an infinite...

Utilizing the Lyapunov functional method and combining linear matrix inequality (LMI) techniques and integral inequality approach (IIA) to analyze the global asymptotic stability for delayed neural networks (DNNs),a new sufficient criterion ensuring the global stability of DNNs is obtained.The criteria are formulated in terms of a set of linear matrix inequalities,which can be checked efficient...

In this paper, the problemof robust exponential stability analysis of uncertain discrete-time recurrent neural networks withMarkovian jumping and time-varying delays is studied. By employing the Lyapunov functional and linear matrix inequality (LMI) approach, a new sufficient criterion is proposed for the global robust exponential stability of discrete-time recurrent neural networks which conta...

this paper studies the consensus problem of nonlinear leader-following multi-agent systems (mas). to do this, the error dynamics between the leader agent and follower ones are described via a takagi-sugeno (ts) fuzzy model. if the obtained ts fuzzy model is stable, then all of the nonlinear agents reach consensus. the consensus problem is investigated based on the parameterized or fuzzy lyapuno...

This article investigates the practical exponential stability and design problems of conformable time-delay systems. Sufficient conditions that confirm proposed class systems are given by utilizing an adequate Lyapunov–Krasovskii functional (L-KF). These expressed in form linear matrix inequalities (LMI) which could be solved using solvers LMI Toolbox MATLAB. Two numerical examples to illustrat...