Linear matrix inequalities in system and control theory
01 Jan 1994-Vol. 15
About: The article was published on 1994-01-01 and is currently open access. It has received 11845 citations till now. The article focuses on the topics: Linear matrix inequality & Kalman–Yakubovich–Popov lemma.
Citations
More filters
Book•
26 Jun 2003
TL;DR: Preface, Notations 1.Introduction to Time-Delay Systems I.Robust Stability Analysis II.Input-output stability A.LMI and Quadratic Integral Inequalities Bibliography Index
Abstract: Preface, Notations 1.Introduction to Time-Delay Systems I.Frequency-Domain Approach 2.Systems with Commensurate Delays 3.Systems withIncommensurate Delays 4.Robust Stability Analysis II.Time Domain Approach 5.Systems with Single Delay 6.Robust Stability Analysis 7.Systems with Multiple and Distributed Delays III.Input-Output Approach 8.Input-output stability A.Matrix Facts B.LMI and Quadratic Integral Inequalities Bibliography Index
4,200 citations
TL;DR: This algorithm gives the first substantial progress in approximating MAX CUT in nearly twenty years, and represents the first use of semidefinite programming in the design of approximation algorithms.
Abstract: We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least.87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution to a nonlinear programming relaxation. This relaxation can be interpreted both as a semidefinite program and as an eigenvalue minimization problem. The best previously known approximation algorithms for these problems had performance guarantees of 1/2 for MAX CUT and 3/4 or MAX 2SAT. Slight extensions of our analysis lead to a.79607-approximation algorithm for the maximum directed cut problem (MAX DICUT) and a.758-approximation algorithm for MAX SAT, where the best previously known approximation algorithms had performance guarantees of 1/4 and 3/4, respectively. Our algorithm gives the first substantial progress in approximating MAX CUT in nearly twenty years, and represents the first use of semidefinite programming in the design of approximation algorithms.
3,932 citations
TL;DR: This work model NCSs with packet dropout and multiple-packet transmission as asynchronous dynamical systems and analyze their stability using stability regions and a hybrid systems technique, and discusses methods to compensate network-induced delay.
Abstract: First, we review some previous work on networked control systems (NCSs) and offer some improvements. Then, we summarize the fundamental issues in NCSs and examine them with different underlying network-scheduling protocols. We present NCS models with network-induced delay and analyze their stability using stability regions and a hybrid systems technique. Following that, we discuss methods to compensate network-induced delay and present experimental results over a physical network. Then, we model NCSs with packet dropout and multiple-packet transmission as asynchronous dynamical systems and analyze their stability. Finally, we present our conclusions.
3,467 citations
TL;DR: This work considers the problem of finding a linear iteration that yields distributed averaging consensus over a network, i.e., that asymptotically computes the average of some initial values given at the nodes, and gives several extensions and variations on the basic problem.
2,692 citations
TL;DR: If U is an ellipsoidal uncertainty set, then for some of the most important generic convex optimization problems (linear programming, quadratically constrained programming, semidefinite programming and others) the corresponding robust convex program is either exactly, or approximately, a tractable problem which lends itself to efficientalgorithms such as polynomial time interior point methods.
Abstract: We study convex optimization problems for which the data is not specified exactly and it is only known to belong to a given uncertainty set U, yet the constraints must hold for all possible values of the data from U. The ensuing optimization problem is called robust optimization. In this paper we lay the foundation of robust convex optimization. In the main part of the paper we show that if U is an ellipsoidal uncertainty set, then for some of the most important generic convex optimization problems (linear programming, quadratically constrained programming, semidefinite programming and others) the corresponding robust convex program is either exactly, or approximately, a tractable problem which lends itself to efficientalgorithms such as polynomial time interior point methods.
2,501 citations