Name
Abstract | ||
|---|---|---|
In the field of control, a wide range of analysis and synthesis problems of linear time-invariant (LTI) systems are reduced to semidefinite programming problems (SDPs). On the other hand, in the field of mathematical programming, a class of conic programming problems, so called the copositive programming problem (COP), is actively studied. COP is a convex optimization problem on the copositive con... |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/LCSYS.2019.2946620 | IEEE Control Systems Letters |
Keywords | Field | DocType |
Stability analysis,Linear systems,Programming,Convex functions,Manganese,Symmetric matrices,Numerical stability | Discrete mathematics,Positive-definite matrix,Conic programming,Convex optimization,Optimization problem,Semidefinite programming,Minkowski addition,Mathematics,Positive systems | Journal |
Volume | Issue | ISSN |
4 | 2 | 2475-1456 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Teruki Kato | 1 | 0 | 0.34 |
| Yoshio Ebihara | 2 | 164 | 19.52 |
| Tomomichi Hagiwara | 3 | 286 | 53.12 |