This technical report discusses the mathematical details and the implementation of the methods discussed in the accompanying paper [PZ06]. In particular a method to find a finite list of inequalities that certify Korkin–Zolotarev reducedness of a quadratic form is presented. Moreover a semidefinite programming relaxation of the space of KZ-reduced quadratic forms is described in detail, together with a branching strategy to optimize over this space. Finally the implementation of these methods is discussed, together with some hints on how to compile and use the programs. The two digital appendices, which can be obtained from the SPOR reports website†, contain a
We consider the problem subject to where is positive definite or positive semi-definite. Variants o...
Diese Doktorarbeit behandelt bekannte und neue Relaxationstechniken für das quadratische Zuordnungsp...
Usually, cutting plane algorithms work by solving a sequence of linear programming relaxations of an...
This technical report discusses the mathematical details and the implementation of the methods discu...
Lattices and quadratic forms have been studied for hundreds of years. We present some clas-sical res...
Korkin and Zolotarev showed that if $$\sum_i A_i\Big(x_i-\sum_{j>i} \alpha_{ij}x_j\Big)^2$$ is the L...
The main purpose of the reduction theory is to construct a fundamental domain of the unimodular grou...
n recent years, the semidefinite relaxation (SDR) technique has been at the center of some of very e...
A standard quadratic optimization problem (StQP) consists in minimizing a quadratic form over a simp...
In barrier methods for constrained optimization, the main work lies in solv-ing large linear systems...
It is well known that semidefinite programming (SDP) can be used to derive useful relaxations for a ...
SoumisNational audienceThis paper presents new semidefinite programming bounds for 0-1 quadratic pro...
We consider relaxations for nonconvex quadratically constrained quadratic programming (QCQP) based o...
In this paper implementation of the extended Dantzig- Wolfe method to solve a general quadratic prog...
Import 29/09/2010Tato práce popisuje využití Duální úlohy v kvadratickém programování a představuje ...
We consider the problem subject to where is positive definite or positive semi-definite. Variants o...
Diese Doktorarbeit behandelt bekannte und neue Relaxationstechniken für das quadratische Zuordnungsp...
Usually, cutting plane algorithms work by solving a sequence of linear programming relaxations of an...
This technical report discusses the mathematical details and the implementation of the methods discu...
Lattices and quadratic forms have been studied for hundreds of years. We present some clas-sical res...
Korkin and Zolotarev showed that if $$\sum_i A_i\Big(x_i-\sum_{j>i} \alpha_{ij}x_j\Big)^2$$ is the L...
The main purpose of the reduction theory is to construct a fundamental domain of the unimodular grou...
n recent years, the semidefinite relaxation (SDR) technique has been at the center of some of very e...
A standard quadratic optimization problem (StQP) consists in minimizing a quadratic form over a simp...
In barrier methods for constrained optimization, the main work lies in solv-ing large linear systems...
It is well known that semidefinite programming (SDP) can be used to derive useful relaxations for a ...
SoumisNational audienceThis paper presents new semidefinite programming bounds for 0-1 quadratic pro...
We consider relaxations for nonconvex quadratically constrained quadratic programming (QCQP) based o...
In this paper implementation of the extended Dantzig- Wolfe method to solve a general quadratic prog...
Import 29/09/2010Tato práce popisuje využití Duální úlohy v kvadratickém programování a představuje ...
We consider the problem subject to where is positive definite or positive semi-definite. Variants o...
Diese Doktorarbeit behandelt bekannte und neue Relaxationstechniken für das quadratische Zuordnungsp...
Usually, cutting plane algorithms work by solving a sequence of linear programming relaxations of an...