Name
Title | ||
|---|---|---|
On avoiding vertexization of robustness problems: the approximate feasibility concept |
Abstract | ||
|---|---|---|
For a large class of robustness problems with uncertain parameter vector q confined to a box Q, there are many papers providing results along the following lines. The desired performance specification is robustly satisfied for all q∈Q if and only if it is satisfied at each vertex qi of Q. Since the number of vertices of Q explodes combinatorically with the dimension of q, the computation associated with the implementation of such results is often intractable. The main point of this paper is to introduce a new approach to such problems aimed at alleviation of this computational complexity problem. To this end, the notion of approximate feasibility is introduced, and the theory which follows from this definition is vertex-free |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1109/TAC.2002.1000280 | Automatic Control, IEEE Transactions |
Keywords | Field | DocType |
monte carlo methods,computational complexity,convex programming,feedback,robust control,approximate feasibility,approximate feasibility concept,convex optimization,performance specification,robustness analysis,robustness problems,uncertain parameter vector,robustness,functional programming,design optimization,satisfiability,automatic control,computer languages | Monte Carlo method,Mathematical optimization,Vertex (geometry),Robustness (computer science),If and only if,Robust control,Convex optimization,Mathematics,Computational complexity theory,Computation | Journal |
Volume | Issue | ISSN |
47 | 5 | 0018-9286 |
Citations | PageRank | References |
12 | 7.52 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Barmish, B.R. | 1 | 71 | 20.04 |
| P. S. Shcherbakov | 2 | 51 | 17.56 |