A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints (Q2248753): Difference between revisions

The quadratic optimization problem with finite many linear equality and a single non-convex quadratic inequality constraints is studied from more points of view. First, a characterization of a separation between a convex set and an open cone is derived in terms of the convexity of the conic hull of some related sets. A relaxed version of Dines theorem is derived in this particular framework. A geometric characterization of the strong duality is obtained without convexity or Slater assumptions, leading to necessary and sufficient optimality condition for this kind of problems. Refinements and improvements of more known results are obtained, together with some necessary conditions of existence.