Finding an Integral vector in an Unknown Polyhedral Cone

Details Finding an Integral vector in an Unknown Polyhedral Cone Finding an Integral vector in an Unknown Polyhedral Cone

2010-01-31

arxiv.org/abs/1002.0117v4

Mathematics

Optimization and Control

Scientific paper

We present an algorithm to find an integral vector in the polyhedral cone $\Gamma=\{X | \textbf{A}X \leq \textbf{0}\}$, without assuming the explicit knowledge of $\textbf{A}$. About the polyhedral cone, $\Gamma$, it is only given that, (i) the elements of \textbf{A} are in $\{-d,-d+1,\...,0,\...,d-1,d\}$, $d \in \mathbb{N}$, and, (ii) $Y=[y(1),y(2),\...,y(n)]$ is a non-zero integral solution to $\Gamma$. The proposed algorithm finds a non-zero integral vector in $\Gamma$ such that its maximum element is less than ${(2d)^{2^{n-1}-1}}/{2^{n-1}}$.

Affiliated with

Also associated with

No associations

Rating

Finding an Integral vector in an Unknown Polyhedral Cone 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 Finding an Integral vector in an Unknown Polyhedral Cone, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding an Integral vector in an Unknown Polyhedral Cone will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-347037