The Volumetric Barrier for Semidefinite Programming

DOI10.1287/moor.25.3.365.12212zbMath1073.90533OpenAlexW2024507128MaRDI QIDQ2757641

Kurt M. Anstreicher

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6d9f728dd1fecc3700c5911abe7e1792d8e38cc1

zbMATH Keywords

volumetric barrier, semidefinite programming, self-concordance

Mathematics Subject Classification ID

Semidefinite programming (90C22) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (7)

Relatively Smooth Convex Optimization by First-Order Methods, and Applications ⋮ A class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming ⋮ Polynomial Interior Point Cutting Plane Methods ⋮ On the volumetric path ⋮ Logarithmic barrier decomposition-based interior point methods for stochastic symmetric programming ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: The Volumetric Barrier for Semidefinite Programming