An Interior-Point Method for Semidefinite Programming

An Interior-Point Method for Semidefinite Programming (2005)

by Christoph Helmberg , Franz Rendl , Robert J. Vanderbei , Henry Wolkowicz

Citations:

User correction supplied by mph

Datum	Value	Source
TITLE	An Interior-Point Method for Semidefinite Programming	SVM HeaderParse 0.2
AUTHOR NAME	Christoph Helmberg	user correction
AUTHOR NAME	Franz Rendl	user correction
AUTHOR NAME	Robert J. Vanderbei	user correction
AUTHOR NAME	Henry Wolkowicz	user correction
AUTHOR AFFIL	Program in Statistics & Operations Research; Princeton University; § Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ont., Canada.	user correction
AUTHOR ADDR	Princeton, NJ 08544	user correction
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.	user correction
YEAR	2005	SVM HeaderParse 0.2
CITATIONS	30 found	ParsCit 1.0