Convex hull results on quadratic programs with non-intersecting constraints

• 成果类型: Article
• 署名作者: Joyce, Alexander; Yang, Boshi
• 署名单位: Clemson University
• 刊物名称: MATHEMATICAL PROGRAMMING
• ISSN/ISSBN: 0025-5610
• DOI: 10.1007/s10107-023-01985-x
• 发表日期: 2024
• 页码: 539-558
• 关键词: planar location-problems; trust-region problems; relaxation; algorithms; FRAMEWORK

摘要

Let F subset of R-n be a nonempty closed set. Understanding the structure of the closed convex hull (C) over bar (F) := <(conv{over bar>{( x, xx(T))|x is an element of F} in the lifted space is crucial for solving quadratic programs related to F. This paper discusses the relationship between C(F) and (C) over bar (G), where G results by adding non-intersecting quadratic constraints to F. We prove that C(G) can be represented as the intersection of C(F) and half spaces defined by the added constraints. The proof relies on a complete description of the asymptotic cones of sets defined by a single quadratic equality and a partial characterization of the recession cone of C(G). Our proof generalizes an existing result for bounded quadratically defined F with non-intersecting hollows and several results on C(G) for G defined by non-intersecting quadratic constraints. The result also implies a sufficient condition for when the lifted closed convex hull of an intersection equals the intersection of the lifted closed convex hulls.