Convex Hull Results on Quadratic Programs with Non-Intersecting Constraints

Let F be a set defined by quadratic constraints. Understanding the structure of the closed convex hull cl(C(F)) := cl(conv{xx’ | x in F}) is crucial to solve quadratically constrained quadratic programs related to F. A set G with complicated structure can be constructed by intersecting simple sets. This paper discusses the relationship between cl(C(F)) … Read more

Weakly Homogeneous Optimization Problems

This paper investigates a new class of optimization problems whose objective functions are weakly homogeneous relative to the constrain sets. Two sufficient conditions for nonemptiness and boundedness of solution sets are established. We also study linear parametric problems and upper semincontinuity of the solution map. Article Download View Weakly Homogeneous Optimization Problems

Erratum to: On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets” [Optim. Letters, 2012]

In this paper, an erratum is provided to the article “\emph{On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets}”, published in Optim.\ Letters, 2012. Due to precise observation of the first author, it has been found that the proof of Lemma 9 has a nontrivial gap, and consequently the main result (Theorem … Read more