Now showing items 1-4 of 4
Rank-Two Relaxation Heuristics for Max-Cut and Other Binary Quadratic Programs
Semidefinite relaxation for certain discrete optimization problems involves replacing a vector-valued variable by a matrix-valued one, producing a convex program while increasing the number of variables by an order of ...
Simultaneous Structure Factor and Contrast Transfer Function Parameter Determination in Transmission Electron Microscopy
We present a new method that allows a fully automated simultaneous determination of the structure factor and the parameters of the Contrast Transfer Function (CTF) and noise function. No previous knowledge of the structure ...
The Effect of the Separation of Variables on the Molecular Replacement Method
Traditional approaches for solving the molecular replacement problem separate a six-dimensional optimization problem into two three-dimensional ones in order to reduce the computational cost. There are, however, serious ...
Maximum Stable Set Formulations and Heuristics Based on Continuous Optimization
The stability number for a given graph G is the size of a maximum stable set in G. The Lovasz theta number provides an upper bound on the stability number and can be computed as the optimal value of the Lovasz semidefinite ...