메뉴 건너뛰기




Volumn , Issue , 2010, Pages 2041-2046

Input design for system identification via convex relaxation

Author keywords

[No Author keywords available]

Indexed keywords

FISHER INFORMATION MATRIX; OPTIMIZATION;

EID: 79953152987     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2010.5717097     Document Type: Conference Paper
Times cited : (43)

References (24)
  • 3
    • 27644436561 scopus 로고    scopus 로고
    • Input design via LMIs admitting frequency-wise model specifications in confidence regions
    • Oct
    • H. Jansson and H. Hjalmarsson, "Input design via LMIs admitting frequency-wise model specifications in confidence regions," IEEE Transactions on Automatic Control, vol. 50, no. 10, Oct 2005.
    • (2005) IEEE Transactions on Automatic Control , vol.50 , Issue.10
    • Jansson, H.1    Hjalmarsson, H.2
  • 4
    • 33747810074 scopus 로고    scopus 로고
    • Least costly identification experiment for control
    • X. Bombois, G. Scorletti, M. Gevers, P. V. den Hof, and R. Hildebrand, "Least costly identification experiment for control," Automatica, vol. 42, no. 10, pp. 1651-1662, 2006.
    • (2006) Automatica , vol.42 , Issue.10 , pp. 1651-1662
    • Bombois, X.1    Scorletti, G.2    Gevers, M.3    Den Hof, P.V.4    Hildebrand, R.5
  • 5
    • 34247473772 scopus 로고    scopus 로고
    • Robust optimal experiment design for system identification
    • C. R. Rojas, J. S. Welsh, G. C. Goodwin, and A. Feuer, "Robust optimal experiment design for system identification," Automatica, vol. 43, no. 6, pp. 993-1008, 2007.
    • (2007) Automatica , vol.43 , Issue.6 , pp. 993-1008
    • Rojas, C.R.1    Welsh, J.S.2    Goodwin, G.C.3    Feuer, A.4
  • 6
    • 63249090253 scopus 로고    scopus 로고
    • Constrained multisine input signals for plant-friendly identification of chemical process systems
    • D. E. Rivera, H. Lee, H. D. Mittelmann, and M. W. Braun, "Constrained multisine input signals for plant-friendly identification of chemical process systems," Journal of Process Control, vol. 19, no. 4, pp. 623-635, 2009.
    • (2009) Journal of Process Control , vol.19 , Issue.4 , pp. 623-635
    • Rivera, D.E.1    Lee, H.2    Mittelmann, H.D.3    Braun, M.W.4
  • 7
    • 0032651288 scopus 로고    scopus 로고
    • Optimal sequences for channel estimation using discrete Fourier transform techniques
    • feb
    • C. Tellambura, M. Parker, Y. Guo, S. Shepherd, and S. Barton, "Optimal sequences for channel estimation using discrete Fourier transform techniques," IEEE Transactions on Communications, vol. 47, no. 2, pp. 230-238, feb 1999.
    • (1999) IEEE Transactions on Communications , vol.47 , Issue.2 , pp. 230-238
    • Tellambura, C.1    Parker, M.2    Guo, Y.3    Shepherd, S.4    Barton, S.5
  • 8
    • 33644655542 scopus 로고    scopus 로고
    • Simplified channel estimation for OFDM systems with multiple transmit antennas
    • Jan
    • Y. Li, "Simplified channel estimation for OFDM systems with multiple transmit antennas," IEEE Transactions on Wireless Communications, vol. 1, no. 1, pp. 67-75, Jan 2002.
    • (2002) IEEE Transactions on Wireless Communications , vol.1 , Issue.1 , pp. 67-75
    • Li, Y.1
  • 9
    • 3042784802 scopus 로고    scopus 로고
    • Training-based channel estimation for multiple-antenna broadband transmissions
    • Mar
    • C. Fragouli, N. Al-Dhahir, and W. Turin, "Training-based channel estimation for multiple-antenna broadband transmissions," IEEE Transactions on Wireless Communications, vol. 2, no. 2, pp. 384-391, Mar 2003.
    • (2003) IEEE Transactions on Wireless Communications , vol.2 , Issue.2 , pp. 384-391
    • Fragouli, C.1    Al-Dhahir, N.2    Turin, W.3
  • 10
    • 22344456222 scopus 로고    scopus 로고
    • Subspace system identification for training-based MIMO channel estimation
    • C. Zhang and R. R. Bitmead, "Subspace system identification for training-based MIMO channel estimation," Automatica, vol. 41, no. 9, pp. 1623-1632, 2005.
    • (2005) Automatica , vol.41 , Issue.9 , pp. 1623-1632
    • Zhang, C.1    Bitmead, R.R.2
  • 17
    • 84893574327 scopus 로고
    • Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
    • M. X. Goemans and D. P. Williamson, "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming," Journal of the ACM, vol. 42, no. 6, pp. 1115-1145, 1995.
    • (1995) Journal of the ACM , vol.42 , Issue.6 , pp. 1115-1145
    • Goemans, M.X.1    Williamson, D.P.2
  • 19
    • 85032752455 scopus 로고    scopus 로고
    • Semidefinite relaxation of quadratic optimization problems
    • Z. Q. Luo, W. K. Ma, A. M. C. So, Y. Ye, and S. Zhang, "Semidefinite relaxation of quadratic optimization problems," IEEE Signal Processing Magazine, vol. 27, no. 3, pp. 20-34, 2010.
    • (2010) IEEE Signal Processing Magazine , vol.27 , Issue.3 , pp. 20-34
    • Luo, Z.Q.1    Ma, W.K.2    So, A.M.C.3    Ye, Y.4    Zhang, S.5
  • 20
    • 17744381831 scopus 로고    scopus 로고
    • Relaxations of quadratic programs in operator theory and system analysis
    • A. Megretski, "Relaxations of quadratic programs in operator theory and system analysis," Operator Theory: Advances and Applications, vol. 129, pp. 365-392, 2001.
    • (2001) Operator Theory: Advances and Applications , vol.129 , pp. 365-392
    • Megretski, A.1
  • 21
    • 0031681870 scopus 로고    scopus 로고
    • Semidefinite relaxation and nonconvex quadratic optimization
    • Y. Nesterov, "Semidefinite relaxation and nonconvex quadratic optimization," Optimization Methods and Software, vol. 9, no. 1-3, pp. 141-160, 1998.
    • (1998) Optimization Methods and Software , vol.9 , Issue.1-3 , pp. 141-160
    • Nesterov, Y.1
  • 23
    • 0007160775 scopus 로고    scopus 로고
    • Hidden convexity in some nonconvex quadratically constrained quadratic programming
    • A. Ben-Tal and M. Teboulle, "Hidden convexity in some nonconvex quadratically constrained quadratic programming," Mathematical Programming, vol. 72, no. 1, pp. 51-63, 1996.
    • (1996) Mathematical Programming , vol.72 , Issue.1 , pp. 51-63
    • Ben-Tal, A.1    Teboulle, M.2
  • 24
    • 0000467513 scopus 로고    scopus 로고
    • On maximization of quadratic form over intersection of ellipsoids with common center
    • A. Nemirovski, C. Roos, and T. Terlaky, "On maximization of quadratic form over intersection of ellipsoids with common center," Mathematical Programming, vol. 86, no. 3, pp. 463-473, 1999.
    • (1999) Mathematical Programming , vol.86 , Issue.3 , pp. 463-473
    • Nemirovski, A.1    Roos, C.2    Terlaky, T.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.