Friday, 15:15 - 15:40 h, Room: H 0110


Georg Still
Minimization of nonconvex quadratic functions on special feasible sets


We are interested in global minimization of general quadratic functions
on a feasible set F. It is well-known that depending on the specific
set F the problem is possibly tractable or hard. We are especially interested in
the minimization on the unit simplex F. This problem is just the feasibility problem for copositive programming.
The latter recently attracted much attention as it appeared that
many hard integer problems can be represented exactly by copositive programs.
In our talk we firstly discuss some interesting properties
of quadratic functions such as the number of components of the level sets and the number of (global) minimizers.
We then consider copositive programming and give some
recent results on the structure of this problem.


Talk 1 of the invited session Fri.3.H 0110
"Structural aspects of global optimization" [...]
Cluster 9
"Global optimization" [...]


  Today, Ohio Loans Online are legitimate, but there are illegal transactions that are still on the rise. The main active actual substance of Levitra Professional online - Vardenafil does not affect the seminal fluid and is not addictive.