Results 1 
3 of
3
Matrix convex functions with applications to weighted centres for semidefinite programming
, 2005
"... In this paper, we develop various calculus rules for general smooth matrixvalued functions and for the class of matrix convex (or concave) functions first introduced by Löwner and Kraus in 1930s. Then we use these calculus rules and the matrix convex function − logX to study a new notion of weight ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
In this paper, we develop various calculus rules for general smooth matrixvalued functions and for the class of matrix convex (or concave) functions first introduced by Löwner and Kraus in 1930s. Then we use these calculus rules and the matrix convex function − logX to study a new notion of weighted centers for semidefinite programming (SDP) and show that, with this definition, some known properties of weighted centers for linear programming can be extended to SDP. We also show how the calculus rules for matrix convex functions can be used in the implementation of barrier methods for optimization problems involving nonlinear matrix functions.
AND THE COMMITTEE ON GRADUATE STUDIES
, 2004
"... dissertation for the degree of Doctor of Philosophy. ..."
(Show Context)
Matrix Functions and Weighted Centers for Semidefinite Programming
, 2007
"... In this paper, we develop various differentiation rules for general smooth matrixvalued functions, and for the class of matrix convex (or concave) functions first introduced by Löwner and Kraus in the 1930s. For a matrix monotone function, we present formulas for its derivatives of any order in an ..."
Abstract
 Add to MetaCart
(Show Context)
In this paper, we develop various differentiation rules for general smooth matrixvalued functions, and for the class of matrix convex (or concave) functions first introduced by Löwner and Kraus in the 1930s. For a matrix monotone function, we present formulas for its derivatives of any order in an integral form. Moreover, for a general smooth primary matrix function, we derive a formula for all of its derivatives by means of the divided differences of the original function. As applications, we use these differentiation rules and the matrix concave function logX to study a new notion of weighted centers for Semidefinite Programming (SDP). We show that, with this definition, some known properties of weighted centers for linear programming can be extended to SDP. We also show how the derivative formulas can be used in the implementation of barrier methods for optimization problems involving nonlinear but convex matrix functions.