Convex Separation from Optimization via Heuristics

Details Convex Separation from Optimization via Heuristics Convex Separation from Optimization via Heuristics

2006-03-22

arxiv.org/abs/cs/0603089v1

Computer Science

Data Structures and Algorithms

Scientific paper

Let $K$ be a full-dimensional convex subset of $\mathbb{R}^n$. We describe a
new polynomial-time Turing reduction from the weak separation problem for $K$
to the weak optimization problem for $K$ that is based on a geometric
heuristic. We compare our reduction, which relies on analytic centers, with the
standard, more general reduction.

Affiliated with

Also associated with

No associations

Rating

Convex Separation from Optimization via Heuristics 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 Convex Separation from Optimization via Heuristics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convex Separation from Optimization via Heuristics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-548447