A symbolic algorithm for determining convexity of a matrix function: how to get Schur complements out of your life Conference Paper

abstract

• An algorithm that gives sufficient and necessary conditions for a noncommutative function to be convex is presented. The implemented version of this algorithm provides a fairly automatic procedure for determination of the domain G of convexity of a noncommutative function. Therefore, the user has in hand a valuable and easy-to-use tool for analyzing matrix inequalities.

name of conference

• Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)

authors

• Skelton, Robert

published proceedings

• Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference

author list (cited authors)

• Camino, J. F., Helton, J. W., & Skelton, R. E.

citation count

• 0

complete list of authors

• Camino, JF||Helton, JW||Skelton, RE

publication date

• January 2000

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• Proceedings of the ... IEEE Conference on Decision & Control / IEEE Control Systems Society. IEEE Conference on Decision & Control  Journal

Digital Object Identifier (DOI)

• 10.1109/cdc.2001.914731

start page

• 5023-5026 vol.5

end page

• 5026

volume

• 5

URL

• http://dx.doi.org/10.1109/cdc.2001.914731