The cone of Z-transformations on the second order cone
S\'andor Z. N\'emeth, M. Seetharama Gowda

TL;DR
This paper explores the structural properties of the cone of Z-transformations on the second order cone, linking it to semidefinite and copositive cones, and illustrating how conic linear programs can be transformed.
Contribution
It characterizes the dual cone of Z-transformations on the second order cone as slices of semidefinite and completely positive cones, providing new insights into conic programming.
Findings
Dual cone is a slice of the semidefinite cone.
Dual cone is a slice of the completely positive cone.
Conic linear programs can be reduced between these cones.
Abstract
In this paper, we describe the structural properties of the cone of -transformations on the second order cone in terms of the semidefinite cone and copositive/completely positive cones induced by the second order cone and its boundary. In particular, we describe its dual as a slice of the semidefinite cone as well as a slice of the completely positive cone of the second order cone. This provides an example of an instance where a conic linear program on a completely positive cone is reduced to a problem on the semidefinite cone.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRings, Modules, and Algebras · Scheduling and Optimization Algorithms · Advanced Optimization Algorithms Research
The cone of -transformations on the second order cone
Sándor Z. Németh
School of Mathematics, University of Birmingham, Watson Building, Edgbaston
Birmingham B15 2TT, United Kingdom
email: [email protected]
M. Seetharama Gowda
Department of Mathematics and Statistics, University of Maryland, Baltimore County
1000 Hilltop Circle, Baltimore, Maryland 21250, U.S.A
email: [email protected]
Abstract
In this paper, we describe the structural properties of the cone of -transformations on the second order cone in terms of the semidefinite cone and copositive/completely positive cones induced by the second order cone and its boundary. In particular, we describe its dual as a slice of the semidefinite cone as well as a slice of the completely positive cone of the second order cone. This provides an example of an instance where a conic linear program on a completely positive cone is reduced to a problem on the semidefinite cone.
Key Words: -transformation, dual cone, second order cone, semidefinite cone, completely positive cone.
AMS Subject Classification: 90C33, 15A48
1 Introduction
Given a proper cone in a finite dimensional real Hilbert space , a linear transformation is said to be a -transformation on if
[TABLE]
where denotes the dual of in . Such transformations appear in various areas including economics, dynamical systems, optimization, see e.g., [1, 2, 3, 4] and the references therein. When is and is the nonnegative orthant, -transformations become -matrices, which are square matrices with nonpositive off-diagonal entries.
The set of all -transformations on is a closed convex cone in the space of all (bounded) linear transformations on . Given their appearance and importance in various areas, describing/characterizing elements of and its interior, boundary, dual, etc., is of interest. An early result of Schneider and Vidyasagar [5] asserts that is a -transformation on if and only if for all ; consequently,
[TABLE]
where denotes the set of all linear transformations that leave invariant, I denotes the identity transformation, and overline denotes the closure. To see another description of , let LL denote the lineality space of , the elements of which are called Lyapunov-like transformations. Then the inclusions
[TABLE]
imply that
[TABLE]
As the cones , , and LL are generally difficult to describe for an arbitrary proper cone , we consider special cases. When is the nonnegative orthant, consists of square matrices with nonpositive off-diagonal entries, consists of nonnegative matrices, and LL consists of diagonal matrices. Consequently, proper polyhedral cones can be handled via isomorphism arguments. Moving away from proper polyhedral cones, in this paper, we focus on the second order cone (also called the Lorentz cone or the ice-cream cone) in the Hilbert space , , defined by:
[TABLE]
This cone, being an example of a symmetric cone, appears prominently in conic optimization [6]. For this cone, Stern and Wolkowicz [7] have shown that * if and only if for some real number , the matrix is positive semidefinite,* where is the diagonal matrix . Another result of Stern and Wolkowicz ([8], Theorem 4.2) asserts that
[TABLE]
(Going in the reverse direction, in a recent paper, Kuzma et al., [9] have shown that for an irreducible symmetric cone , the equality holds only when is isomorphic to )
Characterizations of and LL appear, respectively, in [10] and [11].
In this paper, we describe and its interior, boundary, and dual in terms of the semidefinite cone and the so-called copositive and completely positive cones induced by (or its boundary ) see below for the definitions. In particular, we describe the dual of as a slice of the semidefinite cone and also of the completely positive cone of . This provides an example of an instance where a conic linear optimization problem over a completely positive cone is reduced to a semidefinite problem. To elaborate, consider , the Euclidean -space of (column) vectors with the usual inner product, , the space of all real matrices with the inner product , and , the subspace of all real symmetric matrices in . Corresponding to a closed cone (which is not necessarily convex) in , let
[TABLE]
denote the copositive cone of and
[TABLE]
denote the completely positive cone of , where the sum is a finite sum of objects. When , these two cones coincide with the semidefinite cone ; when , these reduce, respectively, to the (standard) copositive cone and completely positive cone. All these cones appear prominently in conic optimization. A result of Burer [12] (see also, [13, 14]) says that any nonconvex quadratic programming problem over a closed cone with additional linear and binary constraints can be reformulated as a linear program over a suitable completely positive cone. For this and other reasons, there is a strong interest in understanding copositive and completely positive cones. For the closed convex cones and , various structural properties (such as the interior, boundary) as well as duality, irreducibility, and homogeneity properties, have been investigated in the literature, see for example, [15, 16, 17, 18]. Taking to be one of , , or , we show that
[TABLE]
and deduce the equality of slices
[TABLE]
2 Preliminaries
In a (finite dimensional real) Hilbert space , a nonempty set is said to be a closed convex cone if it is closed and whenever and in . Such a cone is said to be proper if and has nonempty interior. Corresponding to a closed convex cone , we define its dual in as the set
[TABLE]
and the complementarity set of as the set We say that a linear transformation is copositive on if for all . We also let where denotes a linear transformation on . For a set in , we denote the closure, interior, and the boundary by , , and respectively. Throughout this paper, we use the summation sign to describe a finite sum of objects.
We will be considering closed convex cones in the space which carries the usual inner product and in the space which carries the inner product where the trace of a square matrix is the sum of its diagonal entries. In , denotes the subspace of all symmetric matrices and denotes the subspace of all skew-symmetric matrices. We note that is the orthogonal direct sum of and .
We recall some (easily verifiable) properties of the second order cone given by (2). is a self-dual cone in , that is, ; its interior and boundary are given, respectively, by
[TABLE]
[TABLE]
We also have
[TABLE]
For a closed cone in , we consider the copositive cone and the completely positive cone (defined in the Introduction). Note that these are cones of symmetric matrices.
In the Hilbert space (which carries the inner product from ), the following hold.
* is the dual cone of [15].*
When , both and are proper cones (**[19]**, Proposition 2.2). In particular, this holds when is one of , , or .
We have or equivalently,
3 Main results
In this section, we provide a closure-free description of and, additionally, describe the dual, interior, and the boundary of . We recall that and denotes the set of all skew-symmetric matrices in .
Theorem 3.1
Let denote one of , , or . Then,
[TABLE]
- Proof.
Let From the result of Stern and Wolkowicz [7] mentioned in the Introduction, we have
[TABLE]
for some and . Hence, , which implies
[TABLE]
where is skew-symmetric. Since , this leads to
[TABLE]
where and . As , this proves that
[TABLE]
Now, to see the reverse inclusions, suppose for some , , and skew-symmetric. Let with . By (6), and are in , and is a positive multiple of . Hence, as and as is skew-symmetric. Thus,
[TABLE]
This shows that and so, inclusions in (9) turn into equalities. Thus we have (7). ∎
Remarks. From the above theorem, we have
[TABLE]
Multiplying throughout by and noting , we get the equality of sets
[TABLE]
where each set is a sum of and a subset of . Since is an (orthogonal) direct sum decomposition, we see that
[TABLE]
These equalities can also be established via different arguments. A result of Loewy and Schneider [10] asserts that A symmetric matrix is copositive on if and only if there exists such that . (This is essentially a consequence of the so-called S-Lemma [20]: If and are two symmetric matrices with for some and , then there exists such that is positive semidefinite.) This result gives the equality
[TABLE]
and consequently . The equality
[TABLE]
can be seen via an application of Finsler’ theorem [20] that says that if and are two symmetric matrices with then there exists such that is positive semidefinite. (For and vectors , one has , where is a natural number and . When is positive semidefinite, it follows that the sequence is bounded.) From this equality, one gets .
Our next result deals with the dual of .
Theorem 3.2
Let denote one of , , or . Then,
[TABLE]
*In particular, (5) holds. *
- Proof.
We fix . From (7), we see that if and only if
[TABLE]
for all real, in , and in . Clearly, this holds if and only if
[TABLE]
for all , , and specified above. Now, with the observation that a (real) matrix is orthogonal to all skew-symmetric matrices in if and only if it is symmetric, this further simplifies to
[TABLE]
where is the dual of computed in . Since in , we see that if and only if . This completes the proof. ∎
We remark that (5) can be deduced directly from (10) by taking the duals in .
In our final result, we describe the interior and boundary of . First, we recall some definitions from [4]. Let
[TABLE]
It is easy to see that is compact and, from (6),
[TABLE]
For any , let
[TABLE]
Note that if and only if . We say that is a strict--transformation on if
[TABLE]
The set of all such transformations is denoted by . For , the following statements are shown in [4], Theorem 3.1:
[TABLE]
and
[TABLE]
Recall that consists of all symmetric matrices that are copositive on . We say that a symmetric matrix is strictly copositive on if ; the set of all such matrices is denoted by . Similarly, one defines .
Corollary 3.3
The following statements hold:
[TABLE]
and
[TABLE]
*where denotes the boundary of in . *
- Proof.
We first deal with the interior of . The equality
[TABLE]
has already been observed in [4], Theorem 3.1. To see the first assertion, we show that if and only if for some , (symmetric) strictly copositive on , and skew-symmetric. Suppose . Then, for any ,
[TABLE]
which, from (11) becomes
[TABLE]
Now, fix and let , where and . As for any , the above inequality implies that \min\Big{\{}\big{\langle}Px,x\big{\rangle}:\,x\in\partial(\mathcal{L}),||x||=1\Big{\}}>0. This proves that is strictly copositive on . Rewriting , we see that which is of the required form.
To see the converse, suppose , where , (symmetric) strictly copositive on , and skew-symmetric. Using (11), we can easily verify that . Thus, .
An argument similar to the above will show that if and only if for some , , and skew-symmetric. This gives the statement regarding the boundary of . ∎
We end the paper with a remark dealing with conic linear programs. Motivated by the result of Burer (mentioned in the Introduction), we consider a conic linear program on a completely positive cone (where is a closed cone):
[TABLE]
While such a problem is generally hard to solve, we ask: (When) can we replace by and thus reduce the above problem to the semidefinite programming problem \min\Big{\{}\langle c,x\rangle:Ax=b,x\in\mathcal{S}_{+}^{n}\Big{\}}? Just replacing by without handling the constraint is not viable as if and only if (which fails to hold when and is pointed), see [18]. While we do not answer this broad question, we point out, as a consequence of (5) that for any ,
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Abraham Berman and Robert J. Plemmons. Nonnegative matrices in the mathematical sciences , volume 9. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1994.
- 2[2] Abraham Berman, Michael Neumann, and Ronald J. Stern. Nonnegative matrices in dynamic systems . Pure and Applied Mathematics (New York). John Wiley & Sons, Inc., New York, 1989.
- 3[3] M. Seetharama Gowda and Jiyuan Tao. ℤ ℤ \mathbb{Z} -transformations on proper and symmetric cones: ℤ ℤ \mathbb{Z} -transformations. Math. Program. , 117(1-2, Ser. B):195–221, 2009.
- 4[4] Jun Fan, J. Tao, and G. Ravindran. On the structure of the set of 𝐙 𝐙 {\bf Z} -transformations on proper cones. Pac. J. Optim. , 13(2):219–226, 2017.
- 5[5] Hans Schneider and Mathukumalli Vidyasagar. Cross-positive matrices. SIAM J. Numer. Anal. , 7:508–519, 1970.
- 6[6] F. Alizadeh and D. Goldfarb. Second-order cone programming. Math. Program. , 95(1, Ser. B):3–51, 2003.
- 7[7] Ronald J. Stern and Henry Wolkowicz. Exponential nonnegativity on the ice cream cone. SIAM J. Matrix Anal. Appl. , 12(1):160–165, 1991.
- 8[8] Ronald J. Stern and Henry Wolkowicz. Trust region problems and nonsymmetric eigenvalue perturbations. SIAM J. Matrix Anal. Appl. , 15(3):755–778, 1994.
