Sciweavers

422 search results - page 3 / 85
» On Non-Approximability for Quadratic Programs
Sort
View
IPCO
2010
153views Optimization» more  IPCO 2010»
13 years 3 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
Christoph Buchheim, Alberto Caprara, Andrea Lodi
ICAL
2011
301views more  ICAL 2011»
12 years 5 months ago
On the LVI-based numerical method (E47 algorithm) for solving quadratic programming problems
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
Yunong Zhang, Senbo Fu, Zhijun Zhang, Lin Xiao, Xu...
MOR
2007
116views more  MOR 2007»
13 years 5 months ago
Complex Matrix Decomposition and Quadratic Programming
This paper studies the possibilities of the Linear Matrix Inequality (LMI) characterization of the matrix cones formed by nonnegative complex Hermitian quadratic functions over sp...
Yongwei Huang, Shuzhong Zhang
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 9 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
JCO
1998
80views more  JCO 1998»
13 years 5 months ago
Semidefinite Programming Relaxations for the Quadratic Assignment Problem
Qing Zhao, Stefan E. Karisch, Franz Rendl, Henry W...