Topics in semidefinite and interior-point methods
type: Item
instance of: scholarly article
title: Topics in semidefinite and interior-point methods
zbMATH Open document ID: 0890.00019
published in: Fields Institute Communications
publication date: 1998-05-27T00:00:00Z
review text: 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 …
Mathematics Subject Classification ID: 00B15
Mathematics Subject Classification ID: 68-06
Mathematics Subject Classification ID: 90-06
zbMATH DE Number: 1157598
zbMATH Keywords: Semidefinite methods
zbMATH Keywords: Interior-point methods
describes a project that uses: SDPpack
MaRDI profile type: Publication
Recommended article: Aspects of semidefinite programming. Interior point algorithms and selected applications
Recommended article: An Interior-Point Method for Semidefinite Programming
Recommended article: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
Recommended article: Q4358711
Recommended article: Interior-point algorithms for semi-infinite programming
Recommended article: Q4799867
Recommended article: Interior-point methods for convex programming
Recommended article: Q5717954
Recommended article: Q3550748
Recommended article: Q4347847
description: scientific article; zbMATH DE number 1157598