#### Filter Results:

- Full text PDF available (48)

#### Publication Year

1993

2017

- This year (1)
- Last 5 years (9)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Christoph Helmberg, Franz Rendl
- SIAM Journal on Optimization
- 2000

A central drawback of primal-dual interior point methods for semidefinite programs is their lack of ability to exploit problem structure in cost and coefficient matrices. This restricts applicability to problems of small dimension. Typically semidefinite relaxations arising in combinatorial applications have sparse and well structured cost and coefficientâ€¦ (More)

- Christoph Helmberg, Franz Rendl, Robert J. Vanderbei, Henry Wolkowicz
- SIAM Journal on Optimization
- 1996

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â€¦ (More)

- Christoph Helmberg
- European Journal of Operational Research
- 2002

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 semideenite matrices. We show that the approach is very eecient for graph bisection problems, such as max-cut. Other applications include max-min eigenvalue problems and relaxationsâ€¦ (More)

- Christoph Helmberg
- Math. Program.
- 2003

- Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl
- IPCO
- 1993

Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The bounds are based on a projection technique developed for the quadratic assignment problem, and once more demonstrate the importance of the extreme eigenvalues of the Laplacian. Theyâ€¦ (More)

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 semideenite matrices. We present a theoretical convergence analysis, and show that the approach is very eecient for graph bisection problems, such as max-cut. The approach can also beâ€¦ (More)

- Christoph Helmberg
- SIAM J. Matrix Analysis Applications
- 1997

The standard technique of reduced cost fixing from linear programming is not trivially extensible to semidefinite relaxations as the corresponding Lagrange multipliers are usually not available. We propose a general technique for computing reasonable Lagrange multipliers to constraints which are not part of the problem description. Its specialization to theâ€¦ (More)

The recent spectral bundle method allows to compute, within reasonable time, approximate dual solutions of large scale semidefinite quadratic 0-1 programming relaxations. We show that it also generates a sequence of primal approximations that converge to a primal optimal solution. Separating with respect to these approximations gives rise to a cutting planeâ€¦ (More)

- Michael Armbruster, Marzena FÃ¼genschuh, Christoph Helmberg, Alexander Martin
- Math. Program. Comput.
- 2012

While semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection, their practical scope is mostly associated with small dense instances. For large sparse instances, cutting plane techniques are considered the method of choice. These are also applicable for semidefinite relaxations via theâ€¦ (More)