1. Robust Decision Problems in Engineering: A Linear Matrix Inequality Approach
Lists
Only you see this
Abstract
1.1 Introduction 1.1.1 Basic idea The basic idea of the LMI method is to formulate a given problem as an optimization problem with linear objective and linear matrix inequality (LMI) constraints. An LMI constraint on a vector is one of the form F (x) = F0 + ∑ i=1 m xi Fi ≥0, 1.1 where the symmetric matrices , , are given. The minimization problem minimize cT x subject to F (x) ≥0, 1.2 where , and means the matrix F is symmetric and positive semidefinite, is called a semidefinite program (SDP). The above framework is particularly attractive for the following reasons. Efficient numerical solution. SDP optimization problems can be solved very efficiently using recent interior-point methods for convex optimization (the global optimum is found in polynomial time). This brings a numerical solution to problems when no analytical or closed-form solution is known. Robustness against uncertainty. The approach is very well suited for problems with uncertainty in the data. Based on a deterministic description of uncertainty (with detailed structure and hard bounds), a systematic procedure enables us to formulate an SDP optimization problem that yields a robust solution. This statement has implications for a wide scope of engineering problems, where measurements, modelling errors, etc., are often present.
BibTeX
@inproceedings{ghaoui2000robust,
author = {Laurent El Ghaoui and Silviu‐Iulian Niculescu},
title = {{1. Robust Decision Problems in Engineering: A Linear Matrix Inequality Approach}},
booktitle = {Society},
year = {2000},
doi = {10.1137/1.9780898719833.ch1},
}Loading related content...