메뉴 건너뛰기




Volumn 46, Issue 4, 2003, Pages 399-454

Matrix inequalities: A symbolic procedure to determine convexity automatically

Author keywords

Computer algebra; Convexity; Matrix inequalities; Noncommutative algebra

Indexed keywords


EID: 0042915013     PISSN: 0378620X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00020-001-1147-7     Document Type: Article
Times cited : (44)

References (20)
  • 1
    • 0032327612 scopus 로고    scopus 로고
    • Primaldual interior-point methods for semidefinite programming: Convergenc e rates, stability and numerical results
    • [AH098]
    • [AH098] Farid Alizadeh, Jean-Pierre A. Haeberly, and Michael L Overton. Primaldual interior-point methods for semidefinite programming: convergence rates, stability and numerical results. SIAM J. Optim., 8(3):746-768, 1998.
    • (1998) SIAM J. Optim. , vol.8 , Issue.3 , pp. 746-768
    • Alizadeh, F.1    Haeberly, J.-P.A.2    Overton, M.L.3
  • 5
    • 0004280284 scopus 로고    scopus 로고
    • An introduction to gröbner bases
    • [Frö97] John Wiley & Sons
    • [Frö97] R. Fröberg, An Introduction to Gröbner Bases. Pure and Applied Mathematics. John Wiley & Sons, 1997.
    • (1997) Pure and Applied Mathematics
    • Fröberg, R.1
  • 7
    • 85039633054 scopus 로고    scopus 로고
    • "Positive" noncommutative polynomial are sums of squares
    • [Hel]
    • [Hel] J. W. Helton. "Positive" noncommutative polynomial are sums of squares. To appear in Annals of Mathematics.
    • Annals of Mathematics
    • Helton, J.W.1
  • 11
    • 0032021829 scopus 로고    scopus 로고
    • Computer simplification of formulas in linear system theory
    • [HSW98] March
    • [HSW98] J. W. Helton, M. Stankus, and J. J. Wavrik. Computer simplification of formulas in linear system theory. IEEE transaction on Automatic Control, 4(3):302-314, March 1998.
    • (1998) IEEE Transaction on Automatic Control , vol.4 , Issue.3 , pp. 302-314
    • Helton, J.W.1    Stankus, M.2    Wavrik, J.J.3
  • 12
    • 85034597616 scopus 로고
    • Gröebner bases for noncommutative polynomial rings
    • [Mor86]
    • [Mor86] Teo Mora. Gröebner bases for noncommutative polynomial rings. Lecture Notes in Computer Sci., 1(229):353-362, 1986.
    • (1986) Lecture Notes in Computer Sci. , vol.1 , Issue.229 , pp. 353-362
    • Mora, T.1
  • 13
    • 0028767836 scopus 로고
    • An introduction to commutative and noncommutative Gröbner bases
    • [Mor94] 7 November
    • [Mor94] Teo Mora. An introduction to commutative and noncommutative Gröbner bases. Theoretical Computer Science, 134(1): 131-173, 7 November 1994.
    • (1994) Theoretical Computer Science , vol.134 , Issue.1 , pp. 131-173
    • Mora, T.1
  • 15
    • 0034542734 scopus 로고    scopus 로고
    • On a decomposition of multivariable forms via LMI methods
    • [Par00]
    • [Par00] P. A. Parrilo. On a decomposition of multivariable forms via LMI methods. In American Control Conference, 2000.
    • (2000) American Control Conference
    • Parrilo, P.A.1
  • 16
    • 0032064831 scopus 로고    scopus 로고
    • An algorithm for sums of squares of real polynomials
    • [PW98]
    • [PW98] V. Powers and T. Wörmann. An algorithm for sums of squares of real polynomials. Journal of Pure and Applied Algebra, 127:99-104, 1998.
    • (1998) Journal of Pure and Applied Algebra , vol.127 , pp. 99-104
    • Powers, V.1    Wörmann, T.2
  • 18
    • 0001776274 scopus 로고
    • Increased roles of linear algebra in control education
    • [SI95]
    • [SI95] R. E. Skelton and T. Iwasaki. Increased roles of linear algebra in control education. IEEE Control Systems, 8:76-90, 1995.
    • (1995) IEEE Control Systems , vol.8 , pp. 76-90
    • Skelton, R.E.1    Iwasaki, T.2
  • 20
    • 0030106462 scopus 로고    scopus 로고
    • Semidefinite programming
    • [VB96] March
    • [VB96] L. Vandeberghe and S. Boyd. Semidefinite programming. SIAM Review, 38:49-95, March 1996.
    • (1996) SIAM Review , vol.38 , pp. 49-95
    • Vandeberghe, L.1    Boyd, S.2


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