The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions

Details The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions

2010-06-04

arxiv.org/abs/1006.0773v1

Mathematics

Optimization and Control

Scientific paper

We consider the nonlinear integer programming problem of minimizing a quadratic function over the integer points in variable dimension satisfying a system of linear inequalities. We show that when the Graver basis of the matrix defining the system is given, and the quadratic function lies in a suitable {\em dual Graver cone}, the problem can be solved in polynomial time. We discuss the relation between this cone and the cone of positive semidefinite matrices, and show that none contains the other. So we can minimize in polynomial time some non-convex and some (including all separable) convex quadrics. We conclude by extending our results to efficient integer minimization of multivariate polynomial functions of arbitrary degree lying in suitable cones.

Affiliated with

Also associated with

No associations

Rating

The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-722461