Given a quadratic function h that satisfies a Slater condition, Yakubovich’s S-Procedure (or S-Lemma) gives a characterization of all other quadratic functions that are copositive with $h$ in a form that is amenable to numerical computations. In this paper we present a deep-rooted connection between the S-Procedure and the dual cone calculus formula $(K_{1} \cap K_{2})^{*} = K^{*}_{1} + K^{*}_{2}$, which holds for closed convex cones in $R^{2}$. To establish the link with the S-Procedure, we generalize the dual cone calculus formula to a situation where $K_{1}$ is nonclosed, nonconvex and nonconic but exhibits sufficient mathematical resemblance to a closed convex one. As a result, we obtain a new proof of the S-Lemma and an extension to Hi...
AbstractThe asymptotic duality theory of linear programming over closed convex cones [4] is extended...
When is the linear image of a closed convex cone closed? We present very simple, and intuitive neces...
When is the linear image of a closed convex cone closed? We present very simple, and intuitive neces...
Given a quadratic function h that satisfies a Slater condition, Yakubovich’s S-Procedure (or S-Lemma...
This thesis is centred around the topic of duality. It presents the classical duality theories in op...
Subject to regularity assumptions, Yakubovich's s-Lemma characterizes the quadratic functions f(x) d...
The celebrated S-lemma establishes a powerful equivalent condition for the non-negativity of a quadr...
AbstractDuality relationships in finding a best approximation from a nonconvex cone in a normed line...
We derive LMI-characterizations and dual decomposition algorithms for certain matrix cones which are...
We derive LMI-characterizations and dual decomposition algorithms for certain matrix cones which are...
Strong (Lagrangian) duality of general conic optimization problems (COPs) has long been studied and ...
textabstractThe aim of this paper is to make a contribution to the investigation of the roots and es...
In this survey we review the many faces of the S-lemma, a result about the correctness of the S-proc...
This paper attempts to extend the notion of duality for convex cones, by basing it on a predescribed...
AbstractDuality relationships in finding a best approximation from a nonconvex cone in a normed line...
AbstractThe asymptotic duality theory of linear programming over closed convex cones [4] is extended...
When is the linear image of a closed convex cone closed? We present very simple, and intuitive neces...
When is the linear image of a closed convex cone closed? We present very simple, and intuitive neces...
Given a quadratic function h that satisfies a Slater condition, Yakubovich’s S-Procedure (or S-Lemma...
This thesis is centred around the topic of duality. It presents the classical duality theories in op...
Subject to regularity assumptions, Yakubovich's s-Lemma characterizes the quadratic functions f(x) d...
The celebrated S-lemma establishes a powerful equivalent condition for the non-negativity of a quadr...
AbstractDuality relationships in finding a best approximation from a nonconvex cone in a normed line...
We derive LMI-characterizations and dual decomposition algorithms for certain matrix cones which are...
We derive LMI-characterizations and dual decomposition algorithms for certain matrix cones which are...
Strong (Lagrangian) duality of general conic optimization problems (COPs) has long been studied and ...
textabstractThe aim of this paper is to make a contribution to the investigation of the roots and es...
In this survey we review the many faces of the S-lemma, a result about the correctness of the S-proc...
This paper attempts to extend the notion of duality for convex cones, by basing it on a predescribed...
AbstractDuality relationships in finding a best approximation from a nonconvex cone in a normed line...
AbstractThe asymptotic duality theory of linear programming over closed convex cones [4] is extended...
When is the linear image of a closed convex cone closed? We present very simple, and intuitive neces...
When is the linear image of a closed convex cone closed? We present very simple, and intuitive neces...