Hybrid system identification: An SDP approach

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2010, Pages 1546-1552

  Feng, C ^a   Lagoa, C M ^a   Ozay, N ^b   Sznaier, M ^b  

^a The Pennsylvania State University   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RELAXATION PROCESSES; SPURIOUS SIGNAL NOISE;

AFFINE HYBRID SYSTEMS; DETERMINISTIC ALGORITHMS; DETERMINISTIC APPROACH; IDENTIFICATION PROBLEM; INPUT/OUTPUT DATUM; MINIMIZING THE NUMBER OF; POLYNOMIAL OPTIMIZATION; RANDOMIZED ALGORITHMS;

HYBRID SYSTEMS;

EID: 79953154978     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2010.5718082     Document Type: Conference Paper

References (16)

1. A. Bemporad, A. Garulli, S. Paoletti, and A. Vicino. A boundederror approach to piecewise affine system identification. IEEE Trans. Automat. Contr., 50(10):1567-1580, 2005. (Pubitemid 41555605)
2. M. Fazel, H. Hindi, and S. Boyd. Log-det heuristic for matrix rank minimization with applications to hankel and euclidean distance matrices. In Proc. Amer. Contr. Conf., 2003.
3. C. Feng, C. M. Lagoa, and M. Sznaier. Hybrid system identication via sparse polynomial optimization. In Proc. Amer. Contr. Conf., 2010.
4. D. Henrion and J. B. Lasserre. Detecting global optimality and extracting solutions in gloptipoly. Technical report, LAAS-CNRS, 2005.
5. Jean B. Lasserre. Global optimization with polynomials and the problem of moments. SIAM J. Optim., 11(3):796-817, 2001.
6. Jean B. Lasserre. Convergent SDP-relaxations in polynomial optimization with sparsity. SIAM J. on Optimization, 17(3):822-843, 2006.
7. M. Laurent. Sums of squares, moment matrices and optimization over polynomials. Emerging applications of algebraic geometry, 149:157-270, 2009.
8. Yi Ma and René Vidal. Identification of deterministic switched arx systems via identification of algebraic varieties. In Hybrid Systems: Computation and Control, pages 449-465, 2005.
9. 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.
10. 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.
11. N. Ozay, M. Sznaier, C. M. Lagoa, and O. Camps. GPCA with denoising: a moment-based convex approach. submitted to IEEE Conference on Computer Vision and Pattern Recognition, 2010.
12. 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.
13. P. A. Parrilo. Semidefinite programming relaxations for semialgebraic problems. Math. Program., 96(2, Ser. B):293-320, 2003.
14. J. Roll, A. Bemporad, and L. Ljung. Identification of piecewise affine systems via mixed-integer programming. Automatica, 40(1):37-50, 2004.
15. 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.
16. 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. (Pubitemid 46279501)