Next Article in Journal
Lines of Curvature for Log Aesthetic Surfaces Characteristics Investigation
Previous Article in Journal
Jet Impingement Cooling of a Rotating Hot Circular Cylinder with Hybrid Nanofluid under Multiple Magnetic Field Effects
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Structural Properties of Faces of the Cone of Copositive Matrices

by
Olga Kostyukova
1,† and
Tatiana Tchemisova
2,*,†
1
Institute of Mathematics, National Academy of Sciences of Belarus, Surganov Str. 11, 220072 Minsk, Belarus
2
Mathematical Department, Campus Universitario Santiago, University of Aveiro, 3810-193 Aveiro, Portugal
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2021, 9(21), 2698; https://doi.org/10.3390/math9212698
Submission received: 21 September 2021 / Revised: 13 October 2021 / Accepted: 19 October 2021 / Published: 24 October 2021
(This article belongs to the Section Computational and Applied Mathematics)

Abstract

:
In this paper, we study the properties of faces and exposed faces of the cone of copositive matrices (copositive cone), paying special attention to issues related to their geometric structure. Based on the concepts of zero and minimal zero vectors, we obtain several explicit representations of faces of the copositive cone and compare them. Given a face of the cone of copositive matrices, we describe the subspace generated by that face and the minimal exposed face containing it. Summarizing the results obtained in the paper, we systematically show what information can be extracted about the given copositive face in the case of incomplete data. Several examples for illustrating the main findings of the paper and also for justifying the usefulness of the developed approach to the study of the facial structure of the copositive cone are discussed.

1. Introduction

The paper is devoted to the study of the facial structure of the cone COP p of copositive matrices and is motivated by our main task for the future: the investigation of optimality conditions for the problems of copositive programming (CoP) and the search for new dual formulations for them.
Copositive problems attract the attention of researchers because they have many interesting applications (see, for example, [1,2,3], and the references therein). Copositive problems belong to the class of conic optimization problems consisting of minimizing a convex function over the intersection of an affine subspace and a convex cone. Conic optimization leads to simple and ingenious formulations of many optimization problems, since it allows one to explicitly describe many important types of constraints in a way that is natural for many applied problems. CoP is sometimes seen as a generalization of Semidefinite Programming (SDP) and a special case of Semi-infinite Programming (SIP), whose important applications are well-known [4,5]. Note that the cone COP p can be considered as a generalization of the cone of semidefinite matrices, but is more complex and its facial structure is less studied than that of the SDP cone.
For convex conic optimization problems, the study of the facial structure of the corresponding cone is crucial, since the properties of its faces can be used for
(1)
creation of regularization algorithms (facial reduction algorithms) and their justification,
(2)
development and understanding of duality theory,
(3)
obtaining optimality conditions,
which are important issues for any optimization problem. For example, in the papers [6,7,8,9], the facial structure of the cone of semidefinite matrices is used to solve the above problems. Currently, some interesting results have been obtained for special classes of faces of the cone COP p in [10,11,12], but in general this problem has not yet been completely resolved. There are many open problems in studying the facial structure of this cone [3,13]. The structure of the faces of other cones is studied in [14].
In our previous work (see [15] and the references in it), we defined the zero and minimal zero vectors of a given convex subset of the cone COP p . These definitions generalize the concepts of zeros and minimal zeros of copositive matrices, which were used in [11] to study the properties of the minimal and maximal faces of COP p . In [15] we showed how with the help of zeros and minimal zeros one can obtain different representations of the faces of the cone COP p and the corresponding dual cones. We also described the minimal face of COP p containing a given convex subset of this cone, and proved some propositions that can be useful for obtaining equivalent representations of feasible sets of copositive problems and creating new numerical methods based on the regularization approach.
In this paper, we will use some of our previous results to give a deeper understanding of the properties of faces of the cone of copositive matrices. In particular, for a given face of COP p , we will describe the minimal exposed face containing this face, and examine the subspace generated by it. Some special classes of faces of the cone COP p and their properties will also be considered. We will show how one can get as much useful information as possible about the properties of a face of COP p in case of incomplete data about this face.
The paper is structured as follows. Section 1 hosts an introduction. Section 2 contains the basic notations and some preliminary results for representing the faces of the cone of copositive matrices in terms of their zeros, which will be used in the following sections. Several examples illustrating these results are also presented in Section 2. In Section 3, we investigate the structural properties of the faces of the cone COP p and the corresponding subspaces. In particular, for a given face of COP p , we describe the subspace generated by that face and the minimal exposed face containing it. In Section 4, we discuss the faces of COP p , which are defined by singleton sets. Section 5 contains several additional examples that justify the usefulness of the approach developed in the paper to the study of the facial structure of the cone COP p . In Section 6, we present the main conclusions and systematically show what information about the face of the copositive cone can be extracted from some incomplete data about this face, based on the results obtained in the paper.

2. Basic Notation and Preliminary Results

2.1. Cones and Faces: General Definitions

Given a finite-dimensional space X , let us recall some general definitions.
A set C X is convex if for any x , y C and any α [ 0 , 1 ] , it holds
α x + ( 1 α ) y C .
Given a set B X , denoted by conv B its convex hull, i.e., the minimal (by inclusion) convex set, containing this set, and by span ( B ) its span, i.e., the smallest linear subspace containing B . A set K X is a cone if for any x K and any α > 0 , it holds α x K .
A nonempty convex subset F of a convex closed set C X is called face of C if from the condition α x + ( 1 α ) y F with x , y C and α ( 0 , 1 ) , it follows that x , y F . The standard notation F C is used to denote that F is a face of the set C. We say that a face F, F C , is proper if F C and write in this case F C .
A face F of a closed convex set C X is called exposed if it can be represented as intersection of C with a supporting hyperplane, i.e., there exist y X and d R such that for all x C it holds: y , x d and y , x = d iff x F . Every exposed face should also be a face. Given a face F of a set C, the minimal (by inclusion) exposed face containing F will be called here the minimal exposed face for that face.
Given a cone K X , its dual cone K * is given by
K * : = { x X : x , y 0 y K } .
Here, and in what follows, the notation : = means that the item on the left-hand side is being defined to be what is on the right-hand side. Similarly, the notation = : means that the item on the right-hand side is being defined to be what is on the left-hand side.

2.2. The Cone of Copositive Matrices and Its Faces

In this paper, we are dealing with special classes of cones of matrices, in particular, with the cones of copositive and completely positive matrices.
Given an integer p > 1 , consider the vector space R p with the standard orthogonal basis { e k , k = 1 , 2 , , p } . This is denoted by R + p ; the set of all p-vectors with non-negative components is denoted by S p —the space of real symmetric p × p matrices.The space S p is considered here as a vector space with the trace inner product A B : = trace ( A B ) .
Let COP p denote the cone of symmetric copositive p × p matrices:
COP p : = { D S p : t D t 0 t R + p } .
Consider a compact subset of R + p in the form of the simplex
T : = { t R + p : e t = 1 }
with e = ( 1 , 1 , , 1 ) R p . It is evident that the cone COP p can be equivalently described as follows:
COP p = { D S p : t D t 0 t T } .
The dual cone to COP p is the cone of completely positive matrices, defined as
( COP p ) * = CP p : = conv { x x : x R + p } .
The cones of copositive and completely positive matrices are known to be proper cones, which means that they are closed, convex, pointed, and fully dimensional. The rest of this section is devoted to two alternative representations of the faces of these cones that will be used in this paper. Some of these results were obtained recently in [15]; others are new and have not been published before.
Given a vector t = ( t k , k [ p ] ) R + p with [ p ] : = { 1 , 2 , , p } , consider support of t , defined as
supp ( t ) : = { k [ p ] : t k > 0 } .
For a set B R p and a point l R p , the distance between them is denoted by ρ ( l , B ) : ρ ( l , B ) : = min τ B k P | l k τ k | .
Consider a finite set of vectors in the above simplex T,
V = { t ( i ) , i I } T .
This is denoted by
σ ( V ) : = min { t k ( i ) , k supp ( t ( i ) ) , i I } > 0 ,
Ω ( V ) : = { t T : ρ ( t , conv V ) σ ( V ) } .
If the set I in (2) is empty, we consider that V = and Ω ( V ) = T .
The following results were obtained in [15].
Lemma 1
(Theorem 1 in [15]). For any D S p and any set V defined in (2), the inequalities
D t ( i ) 0 i I a n d t D t 0 t Ω ( V ) ,
imply the inequalities
t D t 0 t T .
Lemma 2
(Proposition 2 in [15]). Any face K of the cone COP p can be presented as follows:
K = K ( V , L ) : = COP p H ( V , L ) = { D COP p : e k D t ( i ) = 0 , k L ( i ) ; e k D t ( i ) 0 , k [ p ] L ( i ) , i I } ,
where
H ( V , L ) : = { D S p : e k D t ( i ) = 0 , k L ( i ) , i I }
with some vector set V given in (2) and some set
L : = { L ( i ) , i I } ,
whose elements are the sets L ( i ) , i I , satisfying the conditions supp ( t ( i ) ) L ( i ) [ p ] .
In what follows, we assume that any face of COP p is given in the form (5).
The pair of sets { V , L } will be called here the pair of defining sets for the face K ( V , L ) . It is evident that if I = , then K ( V , L ) = COP p . If K ( V , L ) COP p , then I and hence V , L . This case is more interesting for research.
Remark 1.
The subspace H ( V , L ) defined in (6) can be equivalently described as follows:
H ( V , L ) = { D S p : D ( e k ( t ( i ) ) + t ( i ) e k ) = 0 , k L ( i ) , i I } .
Let K COP p . According to the approach proposed in [15], we define the set of vectors satisfying the following conditions:
T 0 ( K ) : = { t T : t D t = 0 D K } .
The set T 0 ( K ) is empty if K = COP p , and is the union of a finite number of convex bounded polyhedra otherwise.
Consider the set
V 0 = V 0 ( K ) : = { τ ( j ) , j J } ,
composed of all vertices of the set conv T 0 ( K ) where J is the set of indices of vertices of the set conv T 0 ( K ) .
In [15], the set T 0 ( K ) was called the set of zeros of the cone K and it was shown that this definition is equivalent to the concept of immobile indices of the constraints of certain related conic optimization problems (see, e.g., [16,17]). It was also shown that the set V 0 of vertices of conv T 0 ( K ) coincides with the set of minimal zeros of the matrix set K . See [15] for the definition of minimal zeros of K .
Given a cone K COP p and the corresponding set of minimal zeros (9), introduce the sets M ( j ) , j J , and M :
M ( j ) : = { k [ p ] : e k D τ ( j ) = 0 D K } , j J ,
M : = { M ( j ) , j J } .
The following lemma is based on the results of [15].
Lemma 3.
Given a face K COP p , let T 0 ( K ) be the set of zeros and V 0 = { τ ( j ) , j J } the set of minimal zeros of K . Let the sets M ( j ) , j J , and M be defined in (10) and (11). Then K can be presented in the form
K = K ( V 0 , M ) : = COP p H ( V 0 , M ) = { D COP p : e k D τ ( j ) = 0 , k M ( j ) , e k D τ ( j ) 0 , k [ p ] M ( j ) , j J } ,
where the subspace H ( V 0 , M ) is defined by the following rules analogous to the rules (6):
H ( V 0 , M ) : = { D S p : e k D τ ( j ) = 0 , k M ( j ) , j J } ,
and there exists a matrix D ^ K such that
t D ^ t > 0 t T T 0 ( K ) , e k D ^ τ ( j ) > 0 k [ p ] M ( j ) , j J .
Remark 2.
From the above considerations, it follows that, in general, for a given K COP p , there may be several pairs { V , L } of defining sets (see Example 1 below). It is worth mentioning that, at the same time, there are faces of COP p , which have a unique pair of defining sets. We consider a set of such faces in Section 4.
To illustrate the concepts introduced above, consider the following example.
Example 1.
Let p = 3 , I = { 1 , 2 } , and t ( 1 ) = 0.5 ( 1 0 1 ) , t ( 2 ) = ( 1 0 0 ) . Set V = { t ( 1 ) , t ( 2 ) } , L = { L ( 1 ) , L ( 2 ) } , where L ( 1 ) = { 1 , 3 } , L ( 2 ) = { 1 } , and consider the face K = K ( V , L ) of COP 3 defined in (5). It is simple to check this is correct:
K = K : = D = 0 b 0 b d f 0 f 0 , b 0 , d 0 , f 0 ,
and T 0 ( K ) : = { t T : t D t = 0 D K } = { t = α e 1 + ( 1 α ) e 3 , α [ 0 , 1 ] } . Hence, for this face K , the set of minimal zeros (i.e., the set of all vertices of conv T 0 ( K ) ) is as follows:
V 0 = { τ ( 1 ) = e 1 , τ ( 2 ) = e 3 } , J = { 1 , 2 } ,
and the corresponding set M defined in (11) and (10) consists of two sets
M = { M ( 1 ) , M ( 2 ) } , M ( 1 ) = M ( 2 ) = { 1 , 3 } .
Note that, as it follows from Lemmas 2 and 3, in this example we have K = K ( V , L ) = K ( V 0 , M ) , but V V 0 and L M .
For the sets V and L given in (2) and (7), consider the corresponding face K = K ( V , L ) defined in (5). As above, let V 0 = { τ ( j ) , j J } be the set of the minimal zeros of K . Define the set
B = B ( V , L , V 0 ) : = { D S p : e k D t ( i ) = 0 , k L ( i ) , e k D t ( i ) 0 , k [ p ] L ( i ) , i I ; e k D τ ( j ) = 0 , k supp ( τ ( j ) ) , e k D τ ( j ) 0 , k [ p ] supp ( τ ( j ) ) , j J } .
Proposition 1.
Given a face K = K ( V , L ) COP p with the corresponding set V 0 of minimal zeros, the following equalities hold true:
M ¯ ( j ) : = { k [ p ] : e k D τ ( j ) = 0 D B } = M ( j ) , j J ,
where the sets M ( j ) , j J , are defined in (10), and the set B is defined in (16).
Proof. 
By construction, K B . Then M ¯ ( j ) M ( j ) , j J .
Let us show that M ( j ) M ¯ ( j ) , j J . Suppose the contrary: there exists j 0 J such that M ( j 0 ) M ¯ ( j 0 ) . Consequently, there exists k 0 [ p ] such that k 0 M ( j 0 ) , k 0 M ¯ ( j 0 ) . Then for some D ¯ B , it holds:
e k 0 D ¯ τ ( j 0 ) > 0 , k 0 [ p ] supp ( τ ( j 0 ) ) .
By construction, we have T 0 ( K ) conv T 0 ( K ) = conv V 0 and by the definition of the set Ω ( V ) (see (4)), we have Ω ( V 0 ) = { t T : ρ ( t , conv V 0 ) σ ( V 0 ) } with σ ( V 0 ) > 0 defined in (3). This implies that
Ω ( V 0 ) T 0 ( K ) = .
According to Lemma 3, there exists a matrix D ^ K such that inequalities (14) hold true. Let us show that
t D ^ t > 0 t Ω ( V 0 ) .
Indeed, suppose the contrary: there exists t ¯ Ω ( V 0 ) such that t ¯ D ^ t ¯ = 0 . Then it follows from (14) that t ¯ T 0 ( K ) and therefore t ¯ T 0 ( K ) Ω ( V 0 ) . However, this contradicts (18). Thus, the inequalities (19) are proved.
For the above matrices D ^ and D ¯ denote D ( α ) : = D ^ + α D ¯ , where α R . From (19) it follows that there exists α > 0 such that
t D ( α ) t 0 t Ω ( V 0 ) and D ( α ) τ ( j ) 0 , j J .
According to Lemma 1, from the relations above, it follows D ( α ) COP p . Hence, taking into account the fact that, by construction, it holds
e k D ( α ) t ( i ) = 0 , k L ( i ) ; e k D ( α ) t ( i ) 0 , k [ p ] L ( i ) , i I ,
we conclude that D ( α ) K . It is simple to observe that
e k 0 D ( α ) τ ( j 0 ) = e k 0 D ^ τ ( j 0 ) + α e k 0 D ¯ τ ( j 0 ) > 0 .
However, on the other hand, from the relations D ( α ) K , j 0 J , k 0 M ( j 0 ) , it follows that e k 0 D ( α ) τ ( j 0 ) = 0 . The resulting contradiction proves the proposition. □
Let us compare the equivalent representations (10) and (17) of the sets M ( j ) , j J . Note that the set B is polyhedral, but the set K is not (in general). Therefore, to construct the set M ¯ ( j ) for any j J , it is enough to solve several Linear Programming (LP) problems. Hence the representation (17) is more constructive than (10) and in the following we assume that the sets M ( j ) , j J , are defined by rules (17).

2.3. Exposed Faces of COP p

At the beginning of this section (see Section 2.1), we presented the definition of exposed faces of a cone. Applying the results from [18] (see page 51), we can say that a face K is an exposed face of COP p if and only if there exists a matrix A CP p such that
K = { D COP p : D A = 0 } .
The following proposition provides additional information about the structure of exposed faces of COP p .
Proposition 2.
A face K COP p is exposed iff it admits representation (5) with some sets V given in (2) and L defined as follows:
L = { L ( i ) = supp ( t ( i ) ) , i I } .
Proof. 
As mentioned above, any exposed face K COP p can be presented in the form (20) with some A CP p . Being completely positive, the matrix A admits the following representation:
A = i I γ i t ( i ) ( t ( i ) ) , where γ i > 0 , t ( i ) T , i I , | I | p ( p + 1 ) / 2 .
For any D COP p and any A in the form (22), let us show the equivalence
D A = 0 e k D t ( i ) = 0 , k supp ( t ( i ) ) , i I .
It is evident that the conditions D COP p and D A = 0 imply ( t ( i ) ) D t ( i ) = 0 , i I . Hence the vectors t ( i ) , i I , solve the optimization problem min t T t D t .
From the optimality conditions for the vectors t ( i ) , i I , in the problem above, it follows that e k D t ( i ) = 0 , k supp ( t ( i ) ) , i I . Thus, we showed the implication
D A = 0 e k D t ( i ) = 0 , k supp ( t ( i ) ) , i I ,
for any D COP p and any A in the form (22).
On the other hand, it is obvious that the conditions e k D t ( i ) = 0 , k supp ( t ( i ) ) , i I , imply ( t ( i ) ) D t ( i ) = 0 , i I , and then D A = i I γ i ( t ( i ) ) D t ( i ) = 0 . Hence, we have shown that
e k D t ( i ) = 0 , k supp ( t ( i ) ) , i I D A = 0 .
For D COP p and A in the form (22), the equivalence of the conditions in (23) follows from the above-proven implications.
It is easy to see that (23) implies the equivalence of representations (20) and (5) with the sets V and L defined in (2) and (21), and the proposition is proved. □
The next lemma presents one known result that will be constructively proved here by representation (5).
Lemma 4.
For any K COP p , there exists anexposedface K e x p of COP p such that K is anexposedface of K e x p .
Proof. 
According to Lemma 2, any face K of the cone COP p admits the representation K = K ( V , L ) (see (5)), where V and L are some sets defined in (2) and (7). Using these sets, let us form matrices
A : = i I t ( i ) ( t ( i ) ) a n d B : = i I k L ( i ) ( e k ( t ( i ) ) + t ( i ) ( e k ) ) .
It is evident that A CP p = ( COP p ) * and B COP p .
Consider the cone K e x p : = { D COP p : D A = 0 } .
By construction, K e x p is an exposed face of COP p and it easy to see that for any matrix D K e x p , it holds
e k D t ( i ) = 0 , k supp ( t ( i ) ) , e k D t ( i ) 0 , k [ p ] supp ( t ( i ) ) , i I .
These relations imply that
B D = 2 i I k L ( i ) e k D t ( i ) 0 D K e x p .
Hence, we have shown that B ( K e x p ) * .
Now, consider the cone K * : = { D K e x p : D B = 0 } . By construction, K * is an exposed face of the cone K e x p (which, in turn, is an exposed face of COP p ) and K * = K . The lemma is proved. □
From the proof of Lemma 4 it follows that the face representation (5) allows one to explicitly describe an exposed face K e x p mentioned in the lemma’s formulation.

3. On the Structural Properties of the Faces of the Cone COP p

3.1. Subspaces Generated by Faces of COP p

Consider the face K COP p defined in (5) in the form K = K ( V , L ) = COP p H ( V , L ) , where the subspace H ( V , L ) and the sets V, L are given in (6), (2), (7), respectively.
In the previous section, it was shown that the face K admits the alternative representation (12) via the subspace H ( V 0 , M ) described in (13) using the set V 0 of the minimal zeros of K and the set M defined in (11), (17). The following statements establish the relationship between the subspaces H ( V , L ) , H ( V 0 , M ) , and span ( K ) .
Lemma 5.
The inclusion H ( V 0 , M ) H ( V , L ) holds true.
Proof. 
For a fixed i 0 I , consider t ( i 0 ) V . Since t ( i 0 ) T 0 ( K ( V , L ) ) conv V 0 , we have
t ( i 0 ) = j J * ( i 0 ) α j τ ( j ) with α j > 0 , j J * ( i 0 ) ,
for some J * ( i 0 ) J . Then
k L ( i 0 ) k M ( j ) j J * ( i 0 ) .
For any D H ( V 0 , M ) , taking into account (24) and (25), calculate
e k D t ( i 0 ) = e k D j J * ( i 0 ) α j τ ( j ) = 0 k L ( i 0 ) .
Then D H ( V , L ) and consequently, H ( V 0 , M ) H ( V , L ) . The lemma is proved. □
The following example illustrates that, in general, H ( V 0 , M ) H ( V , L ) .
Example 2.
For p = 3 , denote t ( 1 ) = ( 1 / 3 1 / 3 1 / 3 ) , t ( 2 ) = ( 0 1 0 ) , I = { 1 , 2 } , V = { t ( i ) , i I } , L = { L ( i ) , i I } , L ( 1 ) = { 1 , 2 , 3 } , L ( 2 ) = { 2 } . Then
H ( V , L ) = a b a b 0 b a b a , a R , b R , K ( V , L ) = COP p H ( V , L ) = a 0 a 0 0 0 a 0 a , a 0 .
The face K ( V , L ) is exposed, since L ( i ) = supp ( t ( i ) ) , i = 1 , 2 .
It is easy to check that T 0 ( K ( V , L ) ) = { t T : t 1 = t 3 } , V 0 = { τ ( j ) , j J } ,
τ ( 1 ) = ( 1 / 2 0 1 / 2 ) , τ ( 2 ) = ( 0 1 0 ) , J = { 1 , 2 } , and M = { M ( j ) , j J } with M ( j ) = { 1 , 2 , 3 } , j J . Hence
H ( V 0 , M ) = a 0 a 0 0 0 a 0 a , a R .
Thus, we have H ( V 0 , M ) H ( V , L ) , dim H ( V 0 , M ) = 1 < dim H ( V , L ) = 2 .
Theorem 1.
Given K COP p , let V 0 = { τ ( j ) , j J } be the set of minimal zeros of K and M the corresponding set defined in (11), (17). Then
span ( K ) = H ( V 0 , M ) .
Proof. 
By definition, span ( K ) : = { D = j = 1 p * α j D j , α j R , D j K , j = 1 , , p * } , where p * = p ( p + 1 ) / 2 . From Lemma 3, it follows that span ( K ) H ( V 0 , M ) .
Let us show that H ( V 0 , M ) span ( K ) . Consider any D ¯ H ( V 0 , M ) . It follows from Lemma 3 that there exists D ^ K satisfying relations (14). Consider a matrix D ( λ ) : = D ¯ + λ D ^ for a sufficiently large λ > 0 . Then for D ( λ ) , it holds
t D ( λ ) t 0 t Ω ( V 0 ) , D ( λ ) τ ( j ) 0 j J .
It follows from the relations above and Lemma 1 that D ( λ ) K . Hence
D ¯ = D ( λ ) λ D ^ , where D ( λ ) K , D ^ K .
This implies that D ¯ span ( K ) . The theorem is proved. □
Corollary 1.
In the notations of Theorem 1, we can state that dim K = dim H ( V 0 , M ) .
To illustrate this corollary, let us again consider Example 2. It easy to see that in this example we have dim K ( V , L ) = dim H ( V 0 , M ) = 1 .
For a set V in the form (2), construct the matrix A = i I t ( i ) ( t ( i ) ) and consider the exposed face K : = { D COP p : D A = 0 } . This face admits the following representations:
K = COP p H 0 = COP p H * = COP p H ( V , L ) = COP p H ( V 0 , M ) ,
where H 0 : = { D S p : D A = 0 } , H * : = { D S p : ( t ( i ) ) D t ( i ) = 0 , i I } , the set L is defined in (21), the set V 0 is the set of minimal zeros of K , and the set M is given by (11) and (17).
For the subspaces H ( V 0 , M ) , H ( V , L ) , H * , and H 0 , the inclusions
H ( V 0 , M ) H ( V , L ) H * H 0
hold true. Hence, the representation K = COP p H ( V 0 , M ) is the best (in terms of the dimension of the subspace used for the representation).

3.2. On the Construction of the Minimal Exposed Face Containing a Given Face

In this subsection, given a face K of the cone COP p , we will consider its minimal exposed face and show how it can be constructed using only the information about the corresponding sets V 0 and M . After that, we will describe the minimal exposed face containing a given convex subset of COP p .
Suppose that for some face K COP p (possibly unknown), the corresponding set V 0 of minimal zeros in the form (9), and the set M defined in (11), (17) are known. Thus, we consider that the finite data sets
V 0 = { τ ( j ) , j J } , M = { M ( j ) , j J }
are given.
First of all, let us note that using the known sets (28), one can explicitly present the face K = K ( V 0 , M ) by the rule (12).
Having data (28), let us partition the index set J into subsets J ( s ) where s S , | S | 1 , such that
(a) J = s S J ( s ) ,
(b) for any s S , it holds j J ( s ) supp ( τ ( j ) ) M ( i ) i J ( s ) ,
(c) if | S | 2 , then s S , s ¯ S , s s ¯ , we have
J ( s ) J ( s ¯ ) , J ( s ¯ ) J ( s ) ,
and i 0 J ( s ) J ( s ¯ ) , j 0 J ( s ¯ ) J ( s ) k 0 supp ( τ ( i 0 ) ) , k 0 M ( j 0 ) .
Note that the conditions (b) and (c) are equivalent to the following conditions, respectively:
(b1) ( τ ( j ) ) D τ ( i ) = 0 j J ( s ) , i J ( s ) , D K , s S ;
(c1)  if | S | 2 , then for all s ¯ S and all s S , s ¯ s ,
the sets J ( s ) J ( s ¯ ) and J ( s ¯ ) J ( s ) are non-empty and
D ¯ K : ( τ ( i ) ) D ¯ τ ( j ) > 0 i J ( s ) J ( s ¯ ) , j J ( s ¯ ) J ( s ) .
Proposition 3.
Suppose that for a face K COP p , the sets (28) are known. Let { J ( s ) , s S } be the partition of the set J such that the conditions(a)(c)are satisfied. Then the set T 0 ( K ) can be presented in the form
T 0 ( K ) = s S T 0 ( s , K ) ,
where
T 0 ( s , K ) : = conv { τ ( j ) , j J ( s ) } , s S .
Proof. 
For s S , consider t T 0 ( s , K ) . By construction, the vector t admits a representation
t = j J ( s ) α j τ ( j ) , α j 0 , j J ( s ) , j J ( s ) α j = 1 .
For any D K , taking into account condition b1), let us calculate
t D t = i J ( s ) j J ( s ) α j α i ( τ ( j ) ) D τ ( i ) = 0 .
Then by definition, t T 0 ( K ) and we have shown the inclusion
s S T 0 ( s , K ) T 0 ( K ) .
Now let us show that T 0 ( K ) s S T 0 ( s , K ) . Consider t T 0 ( K ) . By construction,
t = j J * α j τ ( j ) , α j > 0 , j J * J , j J * α j = 1 .
If there exists s 0 S such that J * J ( s 0 ) , then t T 0 ( s 0 , K ) and, consequently, t s S T 0 ( s , K ) . Suppose that on the contrary, it holds
J * J ( s ) s S .
Denoted by J * ( s ) : = J * J ( s ) , s S , S * : = { s S : J * ( s ) } . It is evident that | S * | 2 and J * = s S * J * ( s ) .
Let s ¯ S * be such that
| J * ( s ¯ ) | = max s S * | J * ( s ) | .
Denoted by S * ( s ¯ ) : = { s S * : J * ( s ) J * ( s ¯ ) } .
If S * ( s ¯ ) = , then J * ( s ) J * ( s ¯ ) = s S * J * ( s ) J * ( s ¯ ) s S * , and hence, J * = J * ( s ¯ ) J ( s ¯ ) . However, this contradicts (33). Therefore, S * ( s ¯ ) .
Consider any s ^ S * ( s ¯ ) . Suppose that J * ( s ¯ ) J * ( s ^ ) = . Then J * ( s ¯ ) J * ( s ^ ) , wherefrom, taking into account that by construction J * ( s ¯ ) J * ( s ^ ) , we get the inequality | J * ( s ¯ ) | < | J * ( s ^ ) | contradicting (34). Hence, we have shown that there exist s ¯ S * and s ^ S * such that
J * ( s ¯ ) J * ( s ^ ) , J * ( s ^ ) J * ( s ¯ ) .
Let i 0 J * ( s ¯ ) J * ( s ^ ) . The condition i 0 J * ( s ¯ ) implies the conditions i 0 J ( s ¯ ) and i 0 J * . The condition i 0 J * ( s ^ ) is equivalent to the following one: i 0 J ( s ^ ) J * wherefrom, taking into account that i 0 J * , we obtain i 0 J ( s ^ ) . Thus, we have shown that i 0 J * ( s ¯ ) J * ( s ^ ) i 0 J ( s ¯ ) J ( s ^ ) .
In a similar way, we can show that j 0 J * ( s ^ ) J * ( s ¯ ) j 0 J ( s ^ ) J ( s ¯ ) .
Hence, due to the condition (c) (see also (c1)), for i 0 J * ( s ¯ ) J * ( s ^ ) J * and
j 0 J * ( s ^ ) J * ( s ¯ ) J * , there exists D ¯ K such that
( τ ( i 0 ) ) D ¯ τ ( j 0 ) > 0 .
As per the properties of minimal zeroes, it follows that
τ D τ ( j ) 0 τ T , j J , D K .
Taking into account these inequalities together with (35) and (32), we get
t D ¯ t = i J * j J * α j α i ( τ ( j ) ) D ¯ τ ( i ) α j 0 α i 0 ( τ ( j 0 ) ) D ¯ τ ( i 0 ) > 0 ,
which contradicts the condition t T 0 ( K ) . Therefore, relations (33) cannot take place.
Hence, we have shown that T 0 ( K ) s S T 0 ( s , K ) . The obtained inclusion and inclusion (31) imply (29). □
Remark 3.
Note that it follows from Proposition 3 that the set T 0 ( K ) can be explicitly described using only the available data (28) (the set of minimal zeros of K and the set M ).
Using the partition { J ( s ) , s S } of the set J satisfying the conditions (a)(c), let us define the following index sets:
P * ( s ) : = j J ( s ) supp ( τ ( j ) ) , s S ,
S ( j ) : = { s S : j J ( s ) } , M * ( j ) : = s S ( j ) P * ( s ) , j J .
Proposition 4.
Under the conditions of Proposition 3, the following inclusions hold true:
M * ( j ) M ( j ) , j J ,
where the sets M ( j ) , j J , are defined in (10) and M * ( j ) , j J , are defined in (37).
Proof. 
Let us, first, prove the inclusions
P * ( s ) M ( j ) , s S ( j ) , j J ,
where the sets P * ( s ) , s S ( j ) , j J , are defined in (36) and (37).
Suppose the contrary: for some j 0 J and s 0 S ( j 0 ) , it holds P * ( s 0 ) M ( j 0 ) . This implies the existence of an index i 0 J ( s 0 ) such that supp ( τ ( i 0 ) ) M ( j 0 ) . Consequently, there exists k 0 supp ( τ ( i 0 ) ) such that k 0 M ( j 0 ) . The latter condition implies that there exists a matrix D ¯ K such that e k 0 D ¯ τ ( j 0 ) > 0 . Furthermore, note that the inclusion s 0 S ( j 0 ) implies j 0 J ( s 0 ) . Since i 0 J ( s 0 ) and j 0 J ( s 0 ) , then by construction, we have ( τ ( i 0 ) ) D τ ( j 0 ) = 0 for all D K . Hence
0 = ( τ ( i 0 ) ) D ¯ τ ( j 0 ) = k supp ( τ ( i 0 ) ) τ k ( i 0 ) e k D ¯ τ ( j 0 ) τ k 0 ( i 0 ) e k 0 D ¯ τ ( j 0 ) > 0 .
The obtained contradiction proves inclusions (39).
It is evident that inclusions (38) follow from (39) and the definition of the sets M * ( j ) , j J (see (37)). The proposition is proved. □
Let { J ( s ) , s S } be the partition of the set J introduced above. Denoted by
τ * ( s ) : = 1 | J ( s ) | j J ( s ) τ ( j ) , τ ¯ ( j ) : = 0.5 ( τ ( j ) + τ * ( s ) ) , j J ( s ) , s S .
For any s S , by construction, we have
τ ¯ ( j ) T 0 ( s , K ) , supp ( τ ¯ ( j ) ) = P * ( s ) , j J ( s ) .
Let us prove the following Lemma.
Lemma 6.
First, let us show that for any s S , we have
K 1 ( s ) : = { D COP p : e k D τ ¯ ( j ) = 0 , k supp ( τ ¯ ( j ) ) , j J ( s ) } = { D COP p : e k D τ ( j ) = 0 , k P * ( s ) , j J ( s ) } = : K 2 ( s ) ,
where the sets P * ( s ) , s S , are defined in (36).
Consider any s S . Recall that the vectors τ ¯ ( j ) , j J ( s ) , are defined in (40). It follows from these definitions that
τ ¯ ( j ) = i J ( s ) α i ( j ) τ ( i ) , τ ( j ) = i J ( s ) β i ( j ) τ ¯ ( i ) j J ( s ) ,
where
α * = α * ( s ) : = 1 2 | J ( s ) | , α i ( j ) = α * , i J ( s ) j , α j ( j ) = α * + 0.5 ; β i ( j ) = 2 α * , i J ( s ) j , β j ( j ) = 2 ( 1 α * ) j J ( s ) .
Notice that, by construction (see (41)), supp ( τ ¯ ( j ) ) = P * ( s ) , j J ( s ) .
Suppose that D K 1 ( s ) . Then, for all j J ( s ) and all k P * ( s ) , we have
e k D τ ( j ) = e k D i J ( s ) β i ( j ) τ ¯ ( i ) = 0
and hence, D K 2 ( s ) .
Now, suppose that D K 2 ( s ) . Then for all j J ( s ) and k P * ( s ) , we have
e k D τ ¯ ( j ) = e k D i J ( s ) α i ( j ) τ ( i ) = 0 ,
wherefrom D K 1 ( s ) . Relations (42) are proved.
By construction, K 1 = s S K 1 ( s ) and it follows from (42) that K 1 = s S K 2 ( s ) .
Suppose that D K 1 = s S K 2 ( s ) . Hence, for any j J , we have e k D τ ( j ) = 0   k P * ( s ) , s S ( j ) . These equalities and (37) imply the equalities e k D τ ( j ) = 0 , k M * ( j ) , j J . Then, by definition, D K 2 .
Now let D K 2 . Taking into account (37), we conclude that e k D τ ( j ) = 0 , k P * ( s ) , j J ( s ) , s S . Consequently, D s S K 2 ( s ) = K 1 . The lemma is proved.
Note that it follows from Proposition 2 that the cone K 1 is an exposed face of COP p and therefore, from the lemma above it follows that the cone K 2 is an exposed face of COP p as well.
Theorem 2.
Let K be a face of the cone COP p . Consider the corresponding finite data sets (28) and the sets M * ( j ) , j J , defined in (37). Then the set
K e x p m i n : = { D COP p : e k D τ ( j ) = 0 , k M * ( j ) , j J }
is the minimal exposed face containing the face K .
Proof. 
Note that it follows from (38) that K K e x p m i n . By construction, K e x p m i n = K 2 , where K 2 is an exposed face. Then K e x p m i n is an exposed face of COP p containing the face K .
To prove that K e x p m i n is the minimal exposed face, suppose the contrary: there exists another exposed face K e x p , such that K K e x p K e x p m i n = K 1 = K 2 and a matrix D ¯ K e x p m i n , such that D ¯ K e x p .
As K e x p is an exposed face, for some vectors ξ ( i ) T , i I , it holds
K e x p = { D COP p : ( ξ ( i ) ) D ξ ( i ) = 0 , i I } , | I | < .
Since D ¯ K e x p , then there exists i 0 I such that ( ξ ( i 0 ) ) D ¯ ξ ( i 0 ) > 0 . By assumption, K K e x p . Then ξ ( i 0 ) T 0 ( K ) and, consequently ξ ( i 0 ) T 0 ( s 0 , K ) for some s 0 S , where the set T 0 ( s 0 , K ) is defined in (30). Hence ξ ( i 0 ) = j J ( s 0 ) α j τ ( j ) with some α j 0 , j J ( s 0 ) , j J ( s 0 ) α j = 1 . These relations together with (43) imply
ξ ( i 0 ) = j J ( s 0 ) α j i J ( s 0 ) β i ( j ) τ ¯ ( i ) = i J ( s 0 ) β i τ ¯ ( i ) ; supp ( ξ ( i 0 ) ) P * ( s 0 ) ,
where β i = 2 ( α i α * ( s 0 ) ) , i J ( s 0 ) , α * ( s 0 ) = 1 / | J ( s 0 ) | .
From the assumption D ¯ K e x p m i n = K 1 , it follows D ¯ K 1 ( s ) s S (where the sets K 1 ( s ) , s S , are defined in (42)) and hence, D ¯ K 1 ( s 0 ) .
Taking into account the latter inclusion and relations (46), we get
( ξ ( i 0 ) ) D ¯ ξ ( i 0 ) = ( ξ ( i 0 ) ) D ¯ j J ( s 0 ) β j τ ¯ ( j ) = k supp ( ξ ( i 0 ) ) ξ k ( i 0 ) e k D ¯ j J ( s 0 ) β j τ ¯ ( j ) = 0 .
This result contradicts the inequality ( ξ ( i 0 ) ) D ¯ ξ ( i 0 ) > 0 , which proves the theorem. □
Using Theorem 2 and following the proof of Lemma 4, one can easily prove the following statement.
Corollary 2.
Any face of the cone COP p is an exposed face of its minimal exposed face.
Note that T 0 ( K ) = T 0 ( K e x p m i n ) for any face K and the corresponding minimal exposed face K e x p m i n .
Theorem 3.
A face K COP p is exposed if and only if W = W * , where
W : = { D S p : e k D τ ( j ) = 0 , k M ( j ) , e k D τ ( j ) 0 , k [ p ] M ( j ) , j J } , W * : = { D S p : e k D τ ( j ) = 0 , k M * ( j ) , e k D τ ( j ) 0 , k [ p ] M * ( j ) , j J } .
Proof. 
Let us show that the faces K and K e x p m i n of COP p admit representations
K = { D W : t D t 0 t Ω ( V 0 ) } , K e x p m i n = { D W * : t D t 0 t Ω ( V 0 ) } ,
where V 0 is the set of all minimal zeros of these faces, and the set Ω ( V 0 ) is defined in (4).
Let K be a face of COP p with the corresponding set of minimal zeros V 0 = { τ ( j ) , j J } . Let the set M = { M ( j ) , j J } be defined in (11). Then, according to Lemma 3 (see (12)), the face K can be presented in the form
K = { D COP p : e k D τ ( j ) = 0 , k M ( j ) , e k D τ ( j ) 0 , k [ p ] M ( j ) , j J } .
Taking into account the definitions of the cone COP p and the set W (see (47)), we obtain
K = { D W : t D t 0 t T } .
Now consider the cone
K ¯ : = { D W : t D t 0 t Ω ( V 0 ) } .
Since Ω ( V 0 ) T then it is evident that K K ¯ .
Let us show that K ¯ K . Consider any D K ¯ . It is evident that the conditions D W , t D t 0 t Ω ( V 0 ) imply that D τ ( j ) 0 j J , t D t 0 t Ω ( V 0 ) and due to Lemma 1 we conclude that D COP p . This implies that D K . Thus, we have proved that the cone K = K ( V 0 , M ) can be presented as K ¯ .
Similarly, it can be shown that the cone K e x p m i n defined in (44) can be presented in the form (48) with W * defined in (47). Thus, representations (48) are justified.
As before, based on (14) and (18), it is simple to show that there exists B K e x p m i n such that t B t > 0 t Ω ( V 0 ) . Note that the set Ω ( V 0 ) is closed and bounded; therefore, for some sufficiently small μ > 0 , , it holds
t B t > μ t Ω ( V 0 ) .
Note that, from (38), it follows W W * . Suppose that W W * . Then there exists D ¯ W * such that D ¯ W . From the conditions B K e x p m i n , D ¯ W * , D ¯ W , and inequalities (49), it follows that for a sufficiently small δ > 0 , we have
t ( B + δ D ¯ ) t 0 t Ω ( V 0 ) ; ( B + δ D ¯ ) W * , ( B + δ D ¯ ) W .
Taking into account (48), we conclude that ( B + δ D ¯ ) K and ( B + δ D ¯ ) K e x p m i n . Therefore K K e x p m i n . As K e x p m i n is the minimal exposed face containing K , it is obvious that K is not exposed.
Now, suppose that W = W * . Then it follows from (48) that K = K e x p m i n and hence K is an exposed face. The theorem is proved. □
Theorem 3 reduces the answer to the question of whether a given face is exposed to checking the condition W = W * , which can be done by solving a unique LP problem when the data (28) is assumed to be known.
Remark 4.
Note that, given a face K COP p , one can show that the respective minimal zeros τ ( j ) and the sets M * ( j ) , j J , can be uniquely constructed using only the set T 0 ( K ) of all zeros of this face. Hence the minimal exposed face containing K can be constructed on the basis of the set of all zeros of K .
There may exist several different faces K m , m = 1 , , m 0 , m 0 > 1 , having the same sets of all their zeros: T 0 ( K l ) = T 0 ( K m ) l , m [ m 0 ] . Hence all these faces have the same minimal exposed face.
Let us illustrate this with the following example.
Example 3.
For p = 3 , consider the sets
V 1 = { t ( 1 ) = e 1 , t ( 2 ) = e 3 } , L 1 = { L 1 ( 1 ) = { 1 , 2 , 3 } , L 1 ( 2 ) = { 1 , 3 } } ,
V 2 = V 1 , L 2 = { L 2 ( 1 ) = { 1 , 3 } , L 2 ( 2 ) = { 1 , 2 , 3 } } ,
V 3 = { t ( 1 ) = 0.5 ( e 1 + e 3 ) , t ( 2 ) = e 1 } , L 3 = { L 3 ( 1 ) = { 1 , 3 } , L 3 ( 2 ) = { 1 } } .
It is easy to check that the faces K i : = K ( V i , L i ) , i = 1 , 2 , 3 , are as follows:
K 1 = { D K : b = 0 } , K 2 = { D K : f = 0 } , K 3 = K ,
where the face K is defined in (15).
For each face K m , m = 1 , 2 , 3 , denote by T 0 ( K m ) the corresponding set of zeros, by V 0 m = { τ m ( j ) , j J m } the set of minimal zeros, and by M m ( j ) , M * m ( j ) , j J m , the sets defined in (17), (37), respectively. Here we have
T 0 ( K m ) = T 0 ( * ) : = { t = α a e 1 + ( 1 α ) e 3 , α [ 0 , 1 ] } , V 0 ( K m ) = { τ m ( 1 ) = e 1 , τ m ( 2 ) = e 3 } , J m = { 1 , 2 } , M * m ( 1 ) = M * m ( 2 ) = { 1 , 3 } , m = 1 , 2 , 3 ; M m ( j ) = L m ( j ) j J m , m = 1 , 2 , M 3 ( j ) = M * 3 ( j ) j J 3 .
For m = 1 , 2 , the faces K m , are not exposed since W m W * m , and the face K 3 is exposed by construction (see Proposition 2). Here the sets W m and W * m are defined by (47) for K m .
Note that the faces K m , m = 1 , 2 , 3 , are different, but have the same set T 0 ( ) of zeros. Hence for any K m , m = 1 , 2 , 3 , the minimal exposed face K e x p m i n ( m ) containing K m should be the same. In fact, in our case, for m = 1 , 2 , 3 , we have K e x p m i n ( m ) = K 3 .

3.3. The Minimal and the Minimal Exposed Faces Containing a Given Set

Based on the results obtained in Section 3.2 and in [15], it is easy to describe the minimal exposed face containing a given closed convex subset of COP p .
Let Q be a convex subset of COP p . Consider the corresponding set of zeros
T 0 ( Q ) : = { t T : t D t = 0 D Q } ,
that is either empty or the union of a finite number of convex bounded polyhedra.
Let V 0 ( Q ) = { τ ( i ) , i J Q } be the set of all vertices of the set conv T 0 ( Q ) .
It was shown in [15] that the minimal face of COP p containing Q can be presented in the form K ( V 0 ( Q ) , M ( Q ) ) , where
M ( Q ) : = { M Q ( j ) , j J Q } , M Q ( j ) : = { k [ p ] : e k D τ ( j ) = 0 D Q } , j J Q .
Applying Theorem 2, we conclude that the minimal exposed face containing the set Q has the form
K e x p m i n ( Q ) = { D COP p : e k D τ ( j ) = 0 , k M * Q ( j ) , j J Q } ,
where the sets M * Q ( j ) , j J Q , are defined by the rules (37) with the sets V 0 and M replaced by V 0 ( Q ) and M ( Q ) .

4. Faces of COP p Defined by Singleton Sets

In this section, we consider a special class of faces of COP p , namely, faces K = K ( V , L ) defined by the sets V and L , where V is a singleton. Since V is a singleton, then by construction, the set L is a singleton as well and we can assume that these sets have the form
V = { τ } T , L = { L } , where L   is such that supp ( τ ) L [ p ] .
Note that the class of faces defined by singleton sets is interesting in terms of studying the facial structure of the cone COP p since all maximal faces of COP p belong to it.
Recall that by definition, a face F of COP p is the maximal face if F COP p and there does not exist a face F ¯ COP p such that F ¯ F and F F ¯ .
The next lemma is proved in [11].
Lemma 7.
A face F COP p is maximal if and only if there exists τ T such that F = { D COP p : τ D τ = 0 } .
The main result of this section is the proof of the following lemma.
Lemma 8.
Consider a face K = K ( V , L ) with the defining sets V and L satisfying (50). Then
(i) T 0 ( K ( V , L ) ) = V and M : = { k [ p ] : e k D τ = 0 D K ( V , L ) } = L ;
(ii)the pair { V , L } is unique, i.e., there is no other pair { V ¯ , L ¯ } such that K ( V , L ) = K ( V ¯ , L ¯ ) ;
(iii) dim ( K ( V , L ) ) = p ( p + 1 ) / 2 | L | .
Proof. 
(i) Let us show that T 0 ( K ( V , L ) ) = { τ } and M = L . Without loss of generality, we can suppose that
supp ( τ ) = [ q * ] , L = [ q ] , 1 q * q p ,
and present τ in the form τ = ( τ * , 0 p q ) , where τ * = ( τ 1 , , τ q ) with τ k > 0 , k = 1 , , q * , and 0 p q = ( 0 , , 0 ) R p q .
Let { τ * , φ k , k = 1 , , q 1 } be an orthogonal basis in R q . Denoted by
Φ : = ( φ k , k = 1 , , q 1 ) R q × ( q 1 ) , D * : = Φ ( Φ ) R q × q .
Consider any vector t * R q . Since the representation t * = k = 1 q 1 α k φ k + α * τ * holds, it is easy to check that
t * D * t * = k = 1 q 1 α k 2 > 0 for all  ; t * R q { τ } , | | t * | | = 1 , = 0 for t * = τ .
Consider a matrix D ¯ : = D * D 0 D 0 I R p × p , where I is the ( p q ) × ( p q ) identity matrix and D 0 is a q × ( p q ) matrix with positive elements.
By construction, t D ¯ t > 0 t T { τ } and τ D ¯ τ = 0 , and
e k D ¯ τ = 0 k L , e k D ¯ τ > 0 k [ p ] L .
Then D ¯ K ( V , L ) , T 0 ( K ( V , L ) ) = { τ } , and M = L .
(ii) Using the latter equalities, it is easy to show that the face K = K ( V , L ) has a unique defining pair { V , L } , i.e., there no other sets V ¯ and L ¯ such that K ( V , L ) = K ( V ¯ , L ¯ ) .
(iii) Finally, let us prove that the dimension of the face K = K ( V , L ) with V = { τ } , τ T , is equal to p ( p + 1 ) / 2 | L | . Taking into account Corollary 1, it is enough to show that
dim H ( V , L ) = dim { D S p : D ( e k τ + τ e k ) = 0 , k L } = p ( p + 1 ) / 2 | L | .
Let us prove that the matrices
( e k τ + τ e k ) , k L ,
are linearly independent. Suppose the contrary, i.e., there exist y k , k L , such that
k L y k ( e k τ + τ e k ) = O p × p , k L | y k | > 0 .
The equality in (53) implies y k τ s + y s τ k = 0 k L , s L and hence y k = 0 k L , which contradicts the inequality in (53). Thus, the matrices in (52) are linearly independent and therefore dim K ( V , L ) = p ( p + 1 ) / 2 | L | .
Note that the above-proven lemma generalizes the related result from [11], where it was shown that a maximal face K m a x : = { D COP p : τ D τ = 0 } of COP p has dimension dim ( K m a x ) = ( p + 1 ) p / 2 | supp ( τ ) | .
For a given τ T , set m 0 = 2 ( p | supp ( τ ) | ) and consider faces
K m = K ( V , L m ) , m = 1 , . . . , m 0 ,
with the defining sets V = { τ } and L m = { L m } such that supp ( τ ) L m [ p ] , and L m L m ¯ , for all m m ¯ .
It follows from Lemma 8 that all faces in (54) are different; for any m = 1 , , m 0 , the face K m has a unique pair of defining sets V = { τ } and L m , and its dimension is dim ( K m ) = p ( p + 1 ) / 2 | L m | .
Set L 1 : = { supp ( τ ) } . From Theorem 2, one can conclude that K ( V , L 1 ) is the minimal exposed face of COP p containing all other faces K m , m = 2 , , m 0 , which are all not exposed. Note that if supp ( τ ) = [ p ] , then m 0 = 1 and the set of faces defined in (54) consists of a unique exposed face K ( V , L 1 ) .

5. Examples

In this section, we present a few more examples that justify the advantages of the approach developed here to the study of the facial structure of the cone COP p and illustrate some of the properties of the faces of COP p .
Let us start with an example illustrating the usefulness of the set of minimal zeros of a face of the cone COP p and the corresponding set M , introduced in this paper. In particular, this example shows that these sets make it possible to explicitly describe the cone dual to this face without using the closure operator.
As above, for some sets V and L in the form (2) and (7), we will consider face K = K ( V , L ) of the cone COP p defined in (5), the corresponding set V 0 = { τ ( j ) , j J } of its minimal zeros, and the set M of the sets M ( j ) , j J , defined by rules (17).
Consider the dual to K cone K * . It was shown in [15] that
K * = cl Z 0 = cl Z 1 = Z 2 ,
where
Z 0 : = { D S p : D = i = 1 p * μ ( i ) ( μ ( i ) ) + i I ( λ ( i ) ( t ( i ) ) + t ( i ) ( λ ( i ) ) ) , μ ( i ) R + p , i = 1 , , p * , λ ( i ) R p , λ k ( i ) = 0 , k [ p ] L ( i ) , i I } ,
Z 1 : = { D S p : D = i = 1 p * μ ( i ) ( μ ( i ) ) + i I ( λ ( i ) ( t ( i ) ) + t ( i ) ( λ ( i ) ) ) , μ ( i ) R + p , i = 1 , , p * ; λ ( i ) R p ; λ k ( i ) 0 , k [ p ] L ( i ) , i I } ,
Z 2 : = { D S p : D = i = 1 p * μ ( i ) ( μ ( i ) ) + j J ( η ( j ) ( τ ( j ) ) + τ ( j ) ( η ( j ) ) ) , μ ( i ) R + p , i = 1 , , p * ; η ( j ) R p ; η k ( j ) 0 , k [ p ] M ( j ) , j J } .
Here, cl B denotes the closure of a set B .
It was shown in [15] that Z 0 Z 1 Z 2 and, in general, Z 0 Z 1 .
Now, let us illustrate that in general Z 1 Z 2 and, therefore, K * Z 1 , which means that we cannot omit the use of the closure operator in that equalities in (55) that concern the sets Z 0 and Z 1 (constructed using the defining sets V and L ), while in the equality in (55) regarding the set Z 2 (constructed using the sets V 0 and M ), no closure operator is needed. This gives us an explicit description of the dual cone K * .
Example 4.
Let us once again consider Example 1 (see Section 2.2), where p = 3 , I = { 1 , 2 } , and t ( 1 ) = 0.5 ( 1 0 1 ) , t ( 2 ) = ( 1 0 0 ) ,   V = { t ( 1 ) , t ( 2 ) } , L = { L ( 1 ) , L ( 2 ) } , with L ( 1 ) = { 1 , 3 } , L ( 2 ) = { 1 } . We have shown that the face K = K ( V , L ) of COP 3 has the form (15) and V 0 = { τ ( 1 ) = e 1 , τ ( 2 ) = e 3 } , J = { 1 , 2 } , M ( 1 ) = M ( 2 ) = { 1 , 3 } .
Consider a vector η = ( η 1 , η 2 , η 3 ) , where η 1 0 , η 2 > 0 , and the matrix
Θ : = η ( τ ( 2 ) ) + τ ( 2 ) η = 0 0 η 1 0 0 η 2 η 1 η 2 2 η 3 = [ θ k , s ] s = 1 , , p ; k = 1 , , p S 3 .
By construction, Θ Z 2 , and it is easy to see that D Θ = 2 η 2 f 0 for any D K . Consequently, Θ K * .
Suppose that Θ Z 1 . Hence it can be presented in the form
Θ = i = 1 p * μ ( i ) ( μ ( i ) ) + i I ( λ ( i ) ( t ( i ) ) + t ( i ) ( λ ( i ) ) )
= Ω + 0.5 2 λ 1 ( 1 ) λ 2 ( 1 ) λ 1 ( 1 ) + λ 3 ( 1 ) λ 2 ( 1 ) 0 λ 2 ( 1 ) λ 1 ( 1 ) + λ 3 ( 1 ) λ 2 ( 1 ) 2 λ 3 ( 1 ) + 2 λ 1 ( 2 ) λ 2 ( 2 ) λ 3 ( 2 ) λ 2 ( 2 ) 0 0 λ 3 ( 2 ) 0 0 ,
where λ 2 ( 1 ) 0 , λ 2 ( 2 ) 0 , λ 3 ( 2 ) 0 ,   Ω = i = 1 p * μ ( i ) ( μ ( i ) ) = [ ω k , s ] s = 1 , 2 , 3 ; k = 1 , 2 , 3 with ω k , s = i = 1 p * μ k ( i ) μ s ( i ) 0 , k = 1 , 2 , 3 ; s = 1 , 2 , 3 .
It follows from the latest relations that
0 = θ 2 , 1 = 0.5 λ 2 ( 1 ) + λ 2 ( 2 ) + ω 2 , 1 , w h e r e   λ 2 ( 1 ) 0 , λ 2 ( 2 ) 0 , ω 2 , 1 0 ,
0 = θ 2 , 2 = 0 + 0 + ω 2 , 2 , w h e r e ω 2 , 2 0 ,
a n d 0 < θ 2 , 3 = 0.5 λ 2 ( 1 ) + ω 2 , 3 .
From (56) and (57), we get λ 2 ( 1 ) = 0 , λ 2 ( 2 ) = 0 , ω 2 , 1 = 0 , ω 2 , 2 = 0 . The equality ω 2 , 2 = 0 implies ω 1 , 2 = ω 2 , 2 = ω 2 , 3 = ω 2 , 1 = ω 3 , 2 = 0 . Then the relation (58) takes the form
0 < θ 2 , 3 = λ 2 ( 1 ) + ω 2 , 3 = 0 .
The obtained contradiction proves that Θ Z 1 . Remind that by construction, Θ K * . Hence K * Z 1 , Z 1 K * .
Note that one can show that if for a face K , the set of zeros T 0 ( K ) consists of isolated elements then all these zeros are the minimal ones. In the next example, we will show that there exists an exposed face K ( V , L ) of COP p with V = { τ ( j ) , j I } and L = { L ( j ) = supp ( τ ( j ) ) , j I } , for which the set of zeros T 0 ( K ( V , L ) ) consists of isolated elements τ ( j ) , j J , such that I J , | I | < | J | , which illustrates that the number | J | of the minimal zeros can be greater than the number | I | of elements in the defining set V . To construct this face we will use some data from Example 5 in [19].
Example 5.
Set p = 11 and consider a p × p matrix S : = ( P p 1 a , , P 1 a , a ) , where P = ( e p , e 1 , , e p 1 ) , a = ( 32 , 18 , 4 , 24 , 31 , 31 , 24 , 4 , 18 , 32 , 32 ) . It is shown in [19] that S COP p and it has 33 isolated zeros:
τ ( i ) = P i u , i = 1 , , 11 ; τ ( i ) = P i v , i = 12 , , 22 ; τ ( i ) = P i w , i = 23 , , 33 ,
where u = 1 21 ( 8 , 0 , 3 , 0 , 0 , 0 , 10 , 0 , 0 , 0 , 0 ) , v = 1 21 ( 10 , 0 , 0 , 0 , 3 , 0 , 8 , 0 , 0 , 0 , 0 ) , and
w = 1 7 ( 2 , 0 , 0 , 2 , 0 , 0 , 0 , 3 , 0 , 0 , 0 ) .
Consider an exposed face
K ¯ : = { D COP p : D M = 0 } , w h e r e   M : = i J τ ( i ) ( τ ( i ) ) , J : = { 1 , , 33 } .
By construction,
( τ ( i ) ) D τ ( i ) = 0 i J , D K ¯ ,
S K ¯ , t S t > 0 t T { τ ( i ) , i J } , e k S τ ( i ) > 0 k [ p ] supp ( τ ( i ) ) , i J .
It follows from the relations above that
T 0 ( K ¯ ) = { τ ( j ) , j J } = V 0 a n d M = { M ( j ) = supp ( τ ( j ) ) , j J } .
Hence, according to Lemma 3, the face K ¯ admits a representation K ¯ = COP p H ( V 0 , M ) , where subspace H ( V 0 , M ) is defined in (13).
One can check that H ( V 0 , M ) = H ( V , L ) , where H ( V , L ) is defined in (6), and
V = { τ ( i ) , i I } , L = { L ( i ) = supp ( τ ( i ) ) , i I } , I = { 12 , , 30 } { 27 } , | I | = 18 .
Hence K ¯ = COP p H ( V , L ) = : K ( V , L ) , where | V | = 18 and the face K ¯ has 33 minimal zeros τ ( j ) , j J .
Based on Theorem 1, we can easily determine the dimension of K ¯ :
dim K ¯ = dim H ( V 0 , M ) = 12 .

6. Summary of the Results and Conclusions

The main contribution of the paper is to study the properties of faces of the copositive cone COP p . The concepts of zeros and minimal zeros were formulated for the case of an arbitrary face K of the cone of copositive matrices and allowed us to obtain various representations of this face, an explicit representation of the subspace generated by it, and to describe the minimal exposed face containing K .
Summarizing the results of the paper, let us consider a few possible scenarios for their application, starting with the strongest and most effective one.
Given a face K of COP p , the following sets (the data) are related to it:
1. the corresponding set T 0 ( K ) of all zeros of K ,
2. the set V 0 of minimal zeros of K (the set of vertices of the set conv T 0 ( K ) ) ,
3. the set M defined in (11),
4. some sets V and L such that the cone K admits representation (5).
Suppose we do not have complete information about the cone K , as only some of the sets from the list above are given. Let us see what information we can easily acquire in the case of incomplete data. The following scenarios are possible here.
A 
In the case when the finite data sets enumerated in 2. and 3. are given, we can
(a1)
explicitly describe the corresponding face of the cone COP p :
K = K ( V 0 , M ) = { D COP p : e k D τ ( j ) = 0 , k M ( j ) , j J } ;
(a2)
easily construct the set T 0 ( K ) (see Proposition 3);
(a3)
explicitly describe (without using the closure operator) the cone K * that is dual to the face K (see (55));
(a4)
explicitly describe the minimal exposed face K e x p m i n containing the face K and check whether the face K is exposed (see Theorems 2 and 3);
(a5)
determine span ( K ) = H ( V 0 , M ) and
dim ( K ) = dim ( H ( V 0 , M ) ) dim ( H ( V , L ) ) ,
where H ( V 0 , M ) : = { D S p : e k D τ ( j ) = 0 , k M ( j ) , j J } .
B 
Suppose that only the set T 0 ( K ) (the first set in the list 1.4.) is given. In this case, we can only do the following:
(b1)
find the set of vertices V 0 = { τ ( j ) , j J } of the set conv T 0 ( K ) ;
(b2)
construct the sets M * ( j ) , j J , defined in (37), and hence
(b3)
explicitly describe the minimal exposed face K e x p m i n containing the face K but not the face K itself.
C 
Suppose that the sets V and L (see (2), (7)) defining the face are given, but it’s unknown whether the pair { V , L } of these sets is the same as the pair { V 0 , M } (i.e., it is possible that { V , L } { V 0 , M } ). In this case the only guaranteed result consists of the explicit description of the face K by the rule (5).
D 
Suppose that additionally to the data given in Scenario C (i.e., the pair of the sets { V , L } , defining the face K = K ( V , L ) by the rule (5)), the set V 0 = { τ ( j ) , j J } of minimal zeros of K is given. In this case one can easily find the sets M ( j ) , j J , and hence provide all the constructions described in the items (a1)–(a5) of Scenario A.
Remark 5.
From the above considerations, it follows that the data set { V 0 , M } is the most useful finite data set for the corresponding face. In some cases, for K = K ( V , L ) , the set V 0 can be constructed based on the available data V and L . From Proposition 1, it follows that having V 0 , V and L , one can find the set M , solving several Linear Programming problems.
In general case, the problem of finding the set V 0 is not trivial, but is very important and deserves a separate consideration.
The results of the paper may help to better understand the facial structure of the cone of copositive matrices and this knowledge can be effectively used in the duality theory of copositive optimization. The explicit descriptions of the faces of the copositive cone and their dual cones can be used in constructive regularization procedures based on the face reduction approach.

Author Contributions

Conceptualization, O.K.; methodology, O.K.; formal analysis, O.K. and T.T.; investigation, O.K. and T.T.; writing—original draft preparation, O.K. and T.T.; writing—review and editing, O.K. and T.T. All authors have read and agreed to the published version of the manuscript.

Funding

This research was partially supported by the state research program “Convergence” (Republic Belarus), Task 1.3.01, by Portuguese funds through CIDMA—Center for Research and Development in Mathematics and Applications, and FCT—Portuguese Foundation for Science and Technology, within the project UIDB/04106/2020.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors thank the anonymous reviewers whose important comments and suggestions helped to significantly improve the presentation of this paper.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
LPLinear Programming
CoPCopositive Programming
SIPSemi-infimite Programming
SDPSemidefinite Programming

References

  1. Ahmed, F.; Dür, M.; Still, G. Copositive Programming via semi-infinite optimization. J. Optim. Theory Appl. 2013, 159, 322–340. [Google Scholar] [CrossRef]
  2. Bomze, I.M. Copositive optimization—Recent developments and applications. EJOR 2012, 216, 509–520. [Google Scholar] [CrossRef] [Green Version]
  3. Dür, M. Copositive Programming—A survey. In Recent Advances in Optimization and Its Applications in Engineering; Diehl, M., Glineur, F., Jarlebring, E., Michielis, W., Eds.; Springer: Berlin/Heidelberg, Germany, 2010; pp. 3–20. [Google Scholar]
  4. Anjos, M.F.; Lasserre, J.B. (Eds.) Handbook of Semidefinite, Conic and Polynomial Optimization; International Series in Operational Research and Management Science; Springer: Berlin, Germany, 2012; Volume 166, 138p. [Google Scholar]
  5. Wolkowicz, H.; Saigal, R.; Vandenberghe, L. (Eds.) Handbook of Semidefinite Programming—Theory, Algorithms, and Applications; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2000. [Google Scholar]
  6. Drusvyatskiy, D.; Wolkowicz, H. The many faces of degeneracy in conic optimization. Found. Trends Optim. 2017, 3, 77–170. [Google Scholar] [CrossRef]
  7. Pataki, G. The geometry of semidefinite programming. In Handbook of Semidefinite Programming; Wolkowicz, H., Saigal, R., Vandenberghe, L., Eds.; Springer: Boston, MA, USA, 2000; pp. 29–65. [Google Scholar]
  8. Ramana, M.V. An exact duality theory for Semidefinite Programming and its complexity implications. Math. Prog. 1997, 77, 129–162. [Google Scholar] [CrossRef]
  9. Ramana, M.V.; Tunçel, L.; Wolkowicz, H. Strong duality for Semidefinite Programming. SIAM J. Optim. 1997, 7, 641–662. [Google Scholar] [CrossRef] [Green Version]
  10. Afonin, A.; Hildebrand, R.; Dickinson, P. The extreme rays of the 6 × 6 copositive cone. J. Glob. Optim. 2021, 79, 153–190. [Google Scholar] [CrossRef]
  11. Dickinson, P.J.C. Geometry of the copositive and completely positive cones. J. Math. Anal. Appl. 2011, 380, 377–395. [Google Scholar] [CrossRef] [Green Version]
  12. Hildebrand, R. Extremal copositive matrices with zero supports of cardinality n − 2. Electron. J. Linear Algebra 2018, 34, 28–34. [Google Scholar] [CrossRef]
  13. Berman, A.; Dür, M.; Shaked-Monderer, N. Open problems in the theory of completely positive and copositive matrices. Electron. J. Linear Algebra 2015, 29, 46–58. [Google Scholar] [CrossRef]
  14. Pataki, G. On the connection of facially exposed and nice cones. J. Math. Anal. Appl. 2013, 400, 211–221. [Google Scholar] [CrossRef]
  15. Kostyukova, O.I.; Tchemisova, T.V. On equivalent representations and properties of faces of the cone of copositive matrices. arXiv 2020, arXiv:2012.03610v1. [Google Scholar]
  16. Kostyukova, O.I.; Tchemisova, T.V. Optimality conditions for convex Semi-Infinite Programming problems with finitely representable compact index sets. J. Optim. Theor Appl. 2017, 175, 76–103. [Google Scholar] [CrossRef] [Green Version]
  17. Kostyukov, O.I.; Tchemisova, T.V.; Dudina, O.S. Immobile indices and CQ-free optimality criteria for linear copositive programming problems. Set-Valued Var. Anal. 2020, 28, 89–107. [Google Scholar] [CrossRef]
  18. Boyd, S.; Vandenberghe, L. Convex Optimization; Cambridge University Press: Cambridge, UK, 2004. [Google Scholar]
  19. Bomze, I.M.; Schachinger, W.R.; Ullrich, R. From seven to eleven: Completely positive matrices with high cp-rank. Linear Algebra Appl. 2014, 459, 208–221. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Kostyukova, O.; Tchemisova, T. Structural Properties of Faces of the Cone of Copositive Matrices. Mathematics 2021, 9, 2698. https://doi.org/10.3390/math9212698

AMA Style

Kostyukova O, Tchemisova T. Structural Properties of Faces of the Cone of Copositive Matrices. Mathematics. 2021; 9(21):2698. https://doi.org/10.3390/math9212698

Chicago/Turabian Style

Kostyukova, Olga, and Tatiana Tchemisova. 2021. "Structural Properties of Faces of the Cone of Copositive Matrices" Mathematics 9, no. 21: 2698. https://doi.org/10.3390/math9212698

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop