Algorithms and software for LMI problems in control

  title={Algorithms and software for LMI problems in control},
  author={Lieven Vandenberghe and Venkataramanan Balakrishnan},
  journal={IEEE Control Systems Magazine},
A number of important problems from system and control theory can be numerically solved by reformulating them as convex optimization problems with linear matrix inequality (LMI) constraints. While numerous articles have appeared cataloging applications of LMIs to control system analysis and design, there have been few publications in the control literature describing the numerical solution of these optimization problems. The purpose of this article is to provide an overview of the state of the… 

Robust Stability and Performance Analysis of Uncertain Systems Using Linear Matrix Inequalities

A wide variety of problems in system and control theory can be formulated or reformulated as convex optimization problems involving linear matrix inequalities (LMIs), that is, constraints requiring

Applications of semidefinite programming in process control

A brief introduction to SDP and its application to problems from chemical process control is provided.

Design of a Gain Scheduling Control Based on Linear Matrix Inequalities for a Dynamic System

This article explains the obtaining of a dynamic system which corresponds to a manipulator with two degrees of freedom "Elbow", which shows the linearization around several operating points of

Design of a Gain Scheduling Control Based on Linear Matrix Inequalities for a Dynamic System

This article explains the obtaining of a dynamic system which corresponds to a manipulator with two degrees of freedom "Elbow", which shows the linearization around several operating points of

Dynamic system methods for solving mixed linear matrix inequalities and linear vector inequalities and equalities

LMI Approach to Suboptimal Guaranteed Cost Control for 2-D Discrete Uncertain Systems

This paper studies the problem of the guaranteed cost control via static-state feedback controllers for a class of two-dimensional (2-D) discrete systems described by the Fornasini-Marchesini second

A perspective for optimization in systems and control : from LMIs to derivative-free methods

This investigation is motivated by the fact that this framework is currently largely dominated by LMIs and convex optimization approaches even when the underlying problems are non-convex, in which case other optimization alternatives than convexity-based methods may often be more adequate.

A neural network for linear matrix inequality problems

A matrix oriented gradient approach is developed to solve a class of linear matrix inequalities (LMIs) which are commonly encountered in the robust control system analysis and design and are proven to be stable in the large.

Multiobjective State-Feedback Control for Stochastic Large-Scale System via LMI Approach

This paper investigates a state-feedback control such that multiobjective performance requirements for stochastic large-scale systems can be achieved. The required objectives consist of disturbance

Alternatives for optimization in systems and control: convex and non-convex approaches

This presentation develops a short overview of main trends of optimization in systems and control, and outlines some new perspectives emerging today, where it is clear that convex and Linear Matrix Inequality methods have become the most common option.



The projective method for solving linear matrix inequalities

The Projective Method is described, a complexity analysis is provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed.

Algorithms and software tools for LMI problems in control: an overview

  • L. VandenbergheV. Balakrishnan
  • Mathematics, Computer Science
    Proceedings of Joint Conference on Control Applications Intelligent Control and Computer Aided Control System Design
  • 1996
An overview of recent developments in algorithms and software for linear matrix inequality (LMI) problems and some extensions of the semidefinite programming (SDP) problem are given.

Synthesis of fixed-structure controllers via numerical optimization

We propose an iterative algorithm for designing linear time-invariant controllers with some prespecified structure. The iterations require the solution of optimization problems based on linear matrix

Biaffine matrix inequality properties and computational methods

Many robust control synthesis problems, including /spl mu//k/sub m/-synthesis, have been shown to be reducible to the problem of finding a feasible point under a biaffine matrix inequality (BMI)

Connections between duality in control theory and convex optimization

The most efficient algorithms for convex optimization solve the primal and dual problems simultaneously, so insight into the system-theoretic meaning of the dual problem can be very helpful in developing efficient algorithms.

A global optimization approach for the BMI problem

The biaffine matrix inequality (BMI) is a potentially very flexible new framework for approaching complex robust control system synthesis problems with multiple plants, multiple objectives and

State-space solutions to standard H2 and H∞ control problems

Simple state-space formulas are presented for a controller solving a standard H∞-problem. The controller has the same state-dimension as the plant, its computation involves only two Riccati

Control system synthesis via bilinear matrix inequalities

This paper introduces the bilinear matrix inequality (BMI) as a simple but flexible framework for approaching robust control system synthesis problems. The BMI is an extension of the linear matrix

A primal—dual potential reduction method for problems involving matrix inequalities

The method is based on the theory developed by Nesterov and Nemirovsky and generalizes Gonzaga and Todd's method for linear programming and proves an overallworst-case operation count of O(m5.5L1.5).

Robust synthesis via bilinear matrix inequalities

The μ/Km-synthesis formulation for robust controller synthesis with frequency dependent scalings/multipliers is shown to be equivalent to a bilinear matrix inequality (BMI) feasibility problem.