AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution

Topics in Semidefinite and Interior-Point Methods

About this Title

Panos M. Pardalos, University of Florida, Gainesville, FL and Henry Wolkowicz, University of Waterloo, Waterloo, ON, Canada, Editors

Publication: Fields Institute Communications
Publication Year: 1998; Volume 18
ISBNs: 978-0-8218-0825-2 (print); 978-1-4704-2986-7 (online)
DOI: https://doi.org/10.1090/fic/018
MathSciNet review: MR1608349
MSC: Primary 90-06

View full volume as PDF

Read more about this volume

Table of Contents

Download chapters as PDF

Front/Back Matter

• View this volume's front and back matter

Chapters

• Alexander Shapiro – Optimality conditions and sensitivity analysis of cone-constrained and semi-definite programs
• Lorant Porkolab and Leonid Khachiyan – Testing the feasibility of semidefinite programs
• Motakuri Ramana – Polyhedra, spectrahedra, and semidefinite programming
• Leonid Faybusovich – Infinite-dimensional semidefinite programming: Regularized determinants and self-concordant barriers
• Monique Laurent – A tour d’horizon on positive semidefinite and Euclidean distance matrix completion problems
• Stefan Karisch and Franz Rendl – Semidefinite programming and graph equipartition
• Charles Johnson, Brenda Kroschel and Michael Lundquist – The totally nonnegative completion problem
• Jun Gu – The multi-SAT algorithm
• M Emamy-K. – How efficiently can we maximize threshold pseudo-Boolean functions?
• Guoliang Xue, Ding-Zhu Du and Frank Hwang – Faster algorithm for shortest network under given topology
• Audris Mockus, Jonas Mockus and Linas Mockus – Bayesian heuristic approach (BHA) and applications to discrete optimization
• Boris Mirkin – Approximation clustering: A mine of semidefinite programming problems
• Kurt Anstreicher and Marcia Fampa – A long-step path following algorithm for semidefinite programming problems
• Christoph Helmberg and Robert Weismantel – Cutting plane algorithms for semidefinite relaxations
• Etienne De Klerk, Cornelis Roos and Tamas Terlaky – Infeasible-start semidefinite programming algorithms via self-dual embeddings
• Stefano Lucidi and Laura Palagi – Solution of the trust region problem via a smooth unconstrained reformulation