×

zbMATH — the first resource for mathematics

An interior-point method for semidefinite programming. (English) Zbl 0853.65066
Authors’ abstract: We propose a new interior-point based method to minimize a linear function of a matrix variable subject to linear equality and inequality constraints over the set of positive semidefinite matrices. We show that the approach is very efficient for graph bisection problems such as max-cut. Other applications include max-min eigenvalue problems and relaxations for the stable set problem.

MSC:
65K05 Numerical mathematical programming methods
90C30 Nonlinear programming
PDF BibTeX XML Cite
Full Text: DOI