Interior point methods in semidefinite programming with applications to combinatorial optimization. (English) Zbl 0833.90087

Alizadeh, Farid

SIAM J. Optim. 5, No. 1, 13-51 (1995).

MSC:

90C10	Integer programming
90C27	Combinatorial optimization
90C25	Convex programming
15A18	Eigenvalues, singular values, and eigenvectors
68R10	Graph theory (including graph drawing) in computer science
90C05	Linear programming
90C35	Programming involving graphs or networks

Keywords:

eigenvalue optimization; semidefinite programming; linear equality constraints; classical cone duality; interior point methods; maximum clique; maximum stable set; perfect graphs