Hybrid system identification via sparse polynomial optimization

Proceedings of the 2010 American Control Conference, ACC 2010

Volumn , Issue , 2010, Pages 160-165

  Feng, Chao ^a   Lagoa, Constantino M ^a   Sznaier, Mario ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AFFINE HYBRID SYSTEMS; COMPUTATIONAL COMPLEXITY REDUCTIONS; DISCRETE TIME; HYBRID SYSTEM IDENTIFICATION; INPUT/OUTPUT DATUM; LARGE SIZES; MEASUREMENT NOISE; NEW APPROACHES; NUMERICAL EXAMPLE; POLYNOMIAL OPTIMIZATION; PRIORI INFORMATION; PROCESS NOISE; SPARSE POLYNOMIALS; SUB-SYSTEMS;

ACOUSTIC NOISE; COMPUTATIONAL COMPLEXITY; ELECTRIC GROUNDING; HYBRID SYSTEMS; IDENTIFICATION (CONTROL SYSTEMS); OPTIMIZATION; SPURIOUS SIGNAL NOISE;

HYBRID COMPUTERS;

EID: 77957779900     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. A. Bemporad, A. Garulli, S. Paoletti, and A. Vicino. A bounded-error approach to piecewise affine system identification. IEEE Trans. Automat. Contr., 50(10):1567-1580, 2005.
2. Dimitris Bertsimas and Santosh Vempala. Solving convex programs by random walks. J. ACM, 51(4):540-556, 2004.
3. F. Dabbene, P. Shcherbakov, and B. T. Polyak. A randomized cutting plane scheme with geometric convergence: probabilistic analysis and SDP applications. In Proc. IEEE Conf. Dec. Contr., pages 3044-3049, 2008.
4. Jean B. Lasserre. Global optimization with polynomials and the problem of moments. SIAM J. Optim., 11(3):796-817, 2001.
5. Jean B. Lasserre. Convergent SDP-relaxations in polynomial optimization with sparsity. SIAM J. on Optimization, 17(3):822-843, 2006.
6. Yi Ma and Rene Vidal. Identification of deterministic switched arx systems via identification of algebraic varieties. In Hybrid Systems: Computation and Control, pages 449-465, 2005.
7. N. Ozay, C. Lagoa, and M. Sznaier. Robust identification of switched affine systems via moments-based convex optimization. In Proc. IEEE Conf. Dec. Contr., 2009.
8. N. Ozay, M. Sznaier, C. Lagoa, and O. Camps. A sparsification approach to set membership identification of a class of affine hybrid systems. In Proc. IEEE Conf. Dec. Contr., pages 123-130, 2008.
9. S. Paoletti, A. Juloski, G. Ferrari-trecate, and R. Vidal. Identification of hybrid systems: a tutorial. European Journal of Control, 13(2):123-130, 2007.
10. P. A. Parrilo. Semidefinite programming relaxations for semialgebraic problems. Math. Program., 96(2, Ser. B):293-320, 2003.
11. J. Roll, A. Bemporad, and L. Ljung. Identification of piecewise affine systems via mixed-integer programming. Automatica, 40(1):37 - 50, 2004.
12. R. Vidal, S. Soatto, Y. Ma, and S. Sastry. An algebraic geometric approach to the identification of a class of linear hybrid systems. In Proc. IEEE Conf. Dec. Contr., pages 167-172, 2003.
13. H. Waki, S. Kim, M. Kojima, and M. Muramatsu. Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity. SIAM J. on Optimization, 17(1):218-242, 2006.
14. H. Waki, S. Kim, M. Kojima, M. Muramatsu, and H. Sugimoto. SparsePOP-a sparse semidefinite programming relaxation of polynomial optimization problems. ACM Trans. Math. Softw., 35(2):1-13, 2008.