Personal tools
You are here: Home Publications A Computational Study of a Gradient-Based Log-Barrier Algorithm for a Class of Large-Scale SDPs
Document Actions

Sam Burer, Renato Monteiro, and Yin Zhang (2003)

A Computational Study of a Gradient-Based Log-Barrier Algorithm for a Class of Large-Scale SDPs

Mathematical Programming Series B, Volume 95(2):pp. 359-379.

The authors of this paper recently introduced a transformation [4] that converts a class of semidefinite programs (SDPs) into nonlinear optimization problems free of matrix-valued constraints and variables. This transformation enables the application of nonlinear optimization techniques to the solution of certain SDPs that are too large for conventional interior-point methods to handle efficiently. Based on the transformation, we proposed a globally convergent, first-order (i.e., gradient-based) log-barrier algorithm for solving a class of linear SDPs. In this paper, we discuss an efficient implementation of the proposed algorithm and report computational results on semidefinite relaxations of three types of combinatorial optimization problems. Our results demonstrate that the proposed algorithm is indeed capable of solving large-scale SDPs and is particularly effective for problems with a large number of constraints.

by admin last modified 2007-12-10 21:06
« September 2010 »
Su Mo Tu We Th Fr Sa
1234
567891011
12131415161718
19202122232425
2627282930
 

Powered by Plone

LACSI Collaborators include:

Rice University LANL UH UNM UIUC UNC UTK