Learn More
We consider an optimization problem of the form min x T Qx + c T x s.t. where P ⊆ R n is a polyhedron defined by m inequalities and Q is general and the µ h ∈ R n and the r h quantities are given; a strongly NP-hard problem. In the case |S| = 1, |K| = 0 and m = 0 one obtains the classical trust-region subproblem which is polynomially solvable, and has been(More)
We derive linear inequality characterizations for sets of the form conv{(x, q) ∈ R d ×R : q ≥ Q(x), x ∈ R d − int(P)} where Q is convex and differentiable and P ⊂ R d. We show that in several cases our characterization leads to polynomial-time separation algorithms that operate in the original space of variables, in particular when Q is a positive-definite(More)
  • 1