A little story in the development of semidefinite programming. One day in 1990, I visited the Computer Science Department of the University of Min-nesota and met a young graduate student, Farid Alizadeh. He, working then on combinatorial optimization, introduced me " semidefinite optimization " or linear programming over the positive definite matrix cone. We had a very extensive discussion that afternoon and concluded that interior-point linear programming algorithms could be applicable to… CONTINUE READING