Topics in semidefinite and interior-point methods (Q1386876): Difference between revisions

The articles of this volume will be reviewed individually. Indexed articles: \textit{Shapiro, Alexander}, Optimality conditions and sensitivity analysis of cone-constrained and semi-definite programs, 1-15 [Zbl 0903.90130] \textit{Porkolab, Lorant; Khachiyan, Leonid}, Testing the feasibility of semidefinite programs, 17-26 [Zbl 0906.90123] \textit{Ramana, Motakuri V.}, Polyhedra, spectrahedra, and semidefinite programming, 27-38 [Zbl 0906.90158] \textit{Faybusovich, Leonid}, Infinite-dimensional semidefinite programming: Regularized determinants and self-concordant barriers, 39-49 [Zbl 0906.90139] \textit{Laurent, Monique}, A tour d'horizon on positive semidefinite and Euclidean distance matrix completion problems, 51-76 [Zbl 0906.05074] \textit{Karisch, Stefan E.; Rendl, Franz}, Semidefinite programming and graph equipartition, 77-95 [Zbl 0905.90171] \textit{Johnson, Charles R.; Kroschel, Brenda K.; Lundquist, Michael}, The totally nonnegative completion problem, 97-107 [Zbl 0902.15012] \textit{Gu, Jun}, The Multi-SAT algorithm, 109-126 [Zbl 0902.68094] \textit{Emamy-K., M. Reza}, How efficiently can we maximize threshold pseudo-Boolean functions?, 127-135 [Zbl 0911.90260] \textit{Xue, Guoliang; Du, Ding-Zhu; Hwang, Frank K.}, Faster algorithm for shortest network under given topology, 137-152 [Zbl 0905.90172] \textit{Mockus, Audris; Mockus, Jonas; Mockus, Linas}, Bayesian Heuristic Approach (BHA) and applications to discrete optimization, 153-165 [Zbl 0905.90143] \textit{Mirkin, Boris}, Approximation clustering: A mine of semidefinite programming problems, 167-180 [Zbl 0903.90177] \textit{Anstreicher, Kurt M.; Fampa, Marcia}, A long-step path following algorithm for semidefinite programming problems, 181-196 [Zbl 0903.90126] \textit{Helmberg, Christoph; Weismantel, Robert}, Cutting plane algorithms for semidefinite relaxations, 197-213 [Zbl 0903.90122] \textit{de Klerk, E.; Roos, C.; Terlaky, T.}, Infeasible-start semidefinite programming algorithms via self-dual embeddings, 215-236 [Zbl 0905.90155] \textit{Lucidi, Stefano; Palagi, Laura}, Solution of the trust region problem via a smooth unconstrained reformulation, 237-250 [Zbl 0905.90158]