2006
DOI: 10.1016/j.automatica.2006.06.021
|View full text |Cite
|
Sign up to set email alerts
|

Generalized pole placement via static output feedback: A methodology based on projections

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0

Year Published

2008
2008
2019
2019

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 33 publications
(15 citation statements)
references
References 21 publications
0
15
0
Order By: Relevance
“…A good example is the set of matrices of some fixed rank: given a singular value decomposition of a matrix, projecting it onto this set is immediate. Furthermore, nonconvex alternating projection algorithms and analogous heuristics are quite popular in practice, in areas such as inverse eigenvalue problems [10,11], pole placement [35,51], information theory [48], low-order control design [23,24,36] and image processing [7,50]. Previous convergence results on nonconvex alternating projection algorithms have been uncommon, and have either focussed on a very special case (see for example [10,30]), or have been much weaker than for the convex case [14,48].…”
Section: Introductionmentioning
confidence: 99%
“…A good example is the set of matrices of some fixed rank: given a singular value decomposition of a matrix, projecting it onto this set is immediate. Furthermore, nonconvex alternating projection algorithms and analogous heuristics are quite popular in practice, in areas such as inverse eigenvalue problems [10,11], pole placement [35,51], information theory [48], low-order control design [23,24,36] and image processing [7,50]. Previous convergence results on nonconvex alternating projection algorithms have been uncommon, and have either focussed on a very special case (see for example [10,30]), or have been much weaker than for the convex case [14,48].…”
Section: Introductionmentioning
confidence: 99%
“…Also plotted in Fig. 12 is the simulated or predicted closed-loop re- sponse G (C l) y t ip w (jω), the FRF corresponding to (39). It can be observed that the predicted closed-loop response is reasonably close to the experimentally determined closed-loop response, except near the first resonance.…”
Section: A System Identification and Control Designmentioning
confidence: 76%
“…Therefore, the optimization problem (36) along with its associated LMI constraints can also be interpreted as a generalized pole placement problem via static output feedback, which is difficult to solve, [36]- [39]. A Bode plot of the pole optimized controller K IRC (s) obtained by minimizing (36) under the convex constraints, Γ > 0 and −D f > G(0) is plotted in Fig.…”
Section: A System Identification and Control Designmentioning
confidence: 99%
See 1 more Smart Citation
“…Assume that K (0) ∈ int (S α ) was found by the RS algorithm (see [16]) or by any other method (see [19][20][21]). Let h > 0 and let U (0) be a unit vector w.r.t.…”
Section: The Practical Algorithm For the Problem Of Lqr Via Sofmentioning
confidence: 99%