Topics in Semidefinite and Interior-point Methods

Theory: Optimality conditions and sensitivity analysis of cone-constrained and semi-definite programs by A. Shapiro Testing the feasibility of semidefinite programs by L. Porkolab and L. Khachiyan Polyhedra, spectrahedra, and semidefinite programming by M. V. Ramana Infinite-dimensional semidefinite programming: Regularized determinants and self-concordant barriers by L. Faybusovich Applications: A tour d'horizon on positive semidefinite and Euclidean distance matrix completion problems by M. Laurent Semidefinite programming and graph equipartition by S. E. Karisch and F. Rendl The totally nonnegative completion problem by C. R. Johnson, B. K. Kroschel, and M. Lundquist The multi-SAT algorithm by J. Gu How efficiently can we maximize threshold pseudo-Boolean functions? by M. R. Emamy-K. Faster algorithm for shortest network under given topology by G. Xue, D.-Z. Du, and F. K. Hwang Bayesian heuristic approach (BHA) and applications to discrete optimization by A. Mockus, J. Mockus, and L. Mockus Approximation clustering: A mine of semidefinite programming problems by B. Mirkin Algorithms: A long-step path following algorithm for semidefinite programming problems by K. M. Anstreicher and M. Fampa Cutting plane algorithms for semidefinite relaxations by C. Helmberg and R. Weismantel Infeasible-start semidefinite programming algorithms via self-dual embeddings by E. De Klerk, C. Roos, and T. Terlaky Solution of the trust region problem via a smooth unconstrained reformulation by S. Lucidi and L. Palagi.