Sciweavers

43 search results - page 5 / 9
» siamjo 2010
Sort
View
SIAMJO
2010
135views more  SIAMJO 2010»
14 years 8 months ago
On the Complexity of Selecting Disjunctions in Integer Programming
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
Ashutosh Mahajan, Ted K. Ralphs
SIAMJO
2010
79views more  SIAMJO 2010»
14 years 8 months ago
Theta Bodies for Polynomial Ideals
Inspired by a question of Lov´asz, we introduce a hierarchy of nested semidefinite relaxations of the convex hull of real solutions to an arbitrary polynomial ideal, called theta...
João Gouveia, Pablo A. Parrilo, Rekha R. Th...
SIAMJO
2010
88views more  SIAMJO 2010»
14 years 4 months ago
A Primal-Dual Exterior Point Method for Nonlinear Optimization
In this paper, a primal dual method for general possible nonconvex nonlinear optimization problems is considered. The method is an exterior point type method which means that it p...
Hiroshi Yamashita, Takahito Tanabe
SIAMJO
2010
110views more  SIAMJO 2010»
14 years 4 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng
SIAMJO
2010
128views more  SIAMJO 2010»
14 years 4 months ago
Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm
We propose a Newton-CG primal proximal point algorithm for solving large scale log-determinant optimization problems. Our algorithm employs the essential ideas of the proximal poi...
Chengjing Wang, Defeng Sun, Kim-Chuan Toh