Several classes of stationary points for rank regularized minimization problems
Yulan Liu, Shaohua Pan

TL;DR
This paper introduces various stationary points for rank regularized minimization problems through different reformulations, providing a relation chart to guide low-rank solution search and characterizing conditions for local minimizers.
Contribution
It defines multiple stationary points for the problem and its reformulations, establishing their relations and offering conditions for local optimality in the PSD cone context.
Findings
Established a relation chart for stationary points across reformulations
Provided weaker conditions for local minimizers to be M-stationary
Characterized the directional limiting normal cone for the PSD cone
Abstract
For the rank regularized minimization problem, we introduce several kinds of stationary points by the problem itself and its equivalent reformulations including the mathematical program with an equilibrium constraint (MPEC), the global exact penalty of the MPEC,the surrogate yielded by eliminating the dual part in the exact penalty. A clear relation chart is established for these stationary points, which guides the user to choose an appropriate reformulation for seeking a low-rank solution. As a byproduct, we also provide a weaker condition for a local minimizer of the MPEC to be the M-stationary point by characterizing the directional limiting normal cone to the graph of the normal cone mapping of the positive semidefinite (PSD) 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
TopicsAdvanced Optimization Algorithms Research · Optimization and Variational Analysis · Sparse and Compressive Sensing Techniques
Several classes of stationary points for rank regularized minimization problems
Yulan Liu111School of Applied Mathematics, Guangdong University of Technology, Guangzhou. and Shaohua Pan222Corresponding author ([email protected]), School of Mathematics, South China University of Technology, Guangzhou.
Abstract
For the rank regularized minimization problem, we introduce several classes of stationary points by the problem itself and its equivalent reformulations including the mathematical program with an equilibrium constraint (MPEC), the global exact penalty of the MPEC, and the surrogate yielded by eliminating the dual part of the exact penalty. A clear relation chart is established among these stationary points, which offers a guidance to choose an appropriate reformulation for seeking a low-rank solution. As a byproduct, for the positive semidefinite (PSD) rank regularized minimization problem, we also provide a weaker condition for a local minimizer of its MPEC reformulation to be the M-stationary point by characterizing the directional limiting normal cone to the graph of the normal cone mapping of the PSD cone.
Keywords: Rank regularized minimization problems; stationary points; matrix MPECs; calmness; directional limiting normal cone
Mathematics Subject Classification(2010): 90C26, 49J52, 49J53
1 Introduction
Let be the linear space of all real matrices equipped with the trace inner product and its induced norm , i.e., for . Given a function , we are interested in the rank regularized problem:
[TABLE]
where is the regularization parameter and is a closed convex set. Unless otherwise stated, we assume that is locally Lipschitz and for any , where and are the regular and limiting subdifferential of at , respectively; see Section 2.1 for their definitions. Such a model is frequently used to seek a low-rank matrix under the scenario where a tight estimation is unavailable for the rank of the target matrix, and is found to have a host of applications in a variety of fields such as statistics [26], control and system identification [8, 9], signal and image processing [3], finance [30], quantum tomography [12], and so on.
Owing to the combinatorial property of the rank function, the problem (1) is generally NP-hard and it is impossible to achieve a global optimal solution by using an algorithm with polynomial-time complexity. So, it is common to obtain a desirable local optimal even feasible solution by solving a convex relaxation or surrogate problem. Although the nuclear-norm convex relaxation method [7] is very popular, it has a weak ability to promote low-rank solutions and even fails to yielding low-rank solutions in some cases [23]. After recognizing this deficiency, some researchers pay their attentions to the nonconvex surrogates of low-rank optimization problems such as the log-determinant surrogate (see [8, 24]) and the Schatten -norm surrogate [15]. As illustrated in [27], the efficiency of nonconvex surrogates depends on its approximation effect.
Recently, by the variational characterization of the rank function, the authors of [1, 21] reformulated the rank regularized problem (1) as an equivalent MPEC and derived an equivalent surrogate from its global exact penalty. In order to illustrate this, let denote the family of proper lower semi-continuous (lsc) convex functions with
[TABLE]
and for each let be the associated lsc convex function given by
[TABLE]
With , the rank regularized problem (1) can be equivalently reformulated as
[TABLE]
which is a matrix MPEC since the constraints and are equivalent to with i.e., the optimality condition of . Under a mild condition, it was shown in [1, 21] that the following penalized problem
[TABLE]
is a global exact penalty of the MPEC (1) in the sense that there exists such that the problem (1) associated to each has the same global optimal solution set as (1) does. With the conjugate function \psi^{*}(s):=\sup_{t\in\mathbb{R}}\big{\{}st-\psi(t)\big{\}} of , one may eliminate the dual variable in (1) and get the following equivalent surrogate of the problem (1)
[TABLE]
As well known, when an algorithm is applied to nonconvex and nonsmooth optimization problems, one generally expects to achieve a stationary point, while the stationary points of equivalent reformulations may have a big difference. Thus, it is necessary to clarify the relation among the stationary points of (1) defined by its equivalent reformulations. Moreover, such a clarification is prerequisite to describe the landscape of stationary points for the rank regularized problem (1). Motivated by this, in Section 3 we introduce the R(egular)-stationary point, the M-stationary point, the EP-stationary point and the DC-stationary point by the problem (1) itself and its reformulation (1)-(6), respectively, and explore the relation among the four classes of stationary points. Figure 1 in Section 3 shows that the set of M-stationary points is almost same as that of R-stationary points, the latter includes that of EP-stationary points under a rank condition, and the set of EP-stationary points coincides with that of DC-stationary points for some appropriate . As a byproduct, for the PSD rank regularized minimization problem, we also provide a weaker condition than the one in [5] for a local minimizer of its MPEC reformulation to be the M-stationary point, by the directional limiting normal cone to the graph of the normal cone mapping of the PSD cone .
We notice that some active research has been done for the stationary points of zero-norm constrained optimization problems (see, e.g., [2, 28, 10]); for example, Burdakov et al. [2] discussed the relation between the M-stationary point and the -stationary point of their equivalent MPEC reformulation; and Pan et al. [28] characterizes the first-order optimality condition which actually defines a class of stationary points by the tangent cone to the zero-norm constrained set. To the best of our knowledge, there are few works to study the stationary points of rank regularized optimization problems. For the special case , the rank regularized problem (1) can reduce to a mathematical program with semidefinite conic complementarity constraints (MPSCCC) and Ding et al. [5] have established the connection among several class of stationary points for the MPSCCC, which are defined by the equivalent reformulations of the complementarity constraints. However, this work is concerned with the relation among the stationary points defined by different equivalent reformulations of the rank regularized problem (1), and aims to establish a clear relation chart for these stationary points so that the user can be guided to choose an appropriate reformulation to seek a low-rank solution.
2 Notation and preliminaries
Throughout this paper, a hollow capital means a finite dimensional vector space equipped with the inner product and its induced norm . The notation denotes the vector space of all real symmetric matrices equipped with the Frobenius norm, and means the set of all positive semidefinite matrices in . Let be the set of matrices with orthonormal columns and denote by . For a given , we denote by and the nuclear norm and the spectral norm of , respectively, and by the singular value vector arranged in a nonincreasing order; and write . For a given and two index sets and , means the submatrix consists of those entries with and . We denote by and the matrix and the vector of all ones respectively whose dimension are known from the context, and by an identity matrix whose dimension is known from the context. For a given set , denotes the indicator function of , i.e., if , otherwise . For a given vector space , denotes the closed unit ball centered at the origin of , and means the closed ball of radius centered at .
2.1 Normal cones and generalized differentials
Let be a given set. The regular normal cone to at a point is defined by
[TABLE]
where the symbol signifies with , while the limiting normal cone to at is defined as the outer limit of as , i.e.,
[TABLE]
The limiting normal cone is generally not convex, but the regular normal is always closed convex which is the negative polar of the contingent cone to at :
[TABLE]
When is convex, and are the normal cone in the sense of convex analysis [31]. The directional limiting normal cone to at in a direction is defined by
[TABLE]
By comparing with the definition of , clearly, for any .
Let be an extended real-valued lsc function with finite. The regular subdifferential of at , denoted by , is defined as
[TABLE]
and the (limiting) subdifferential of at , denoted by , is defined as
[TABLE]
From [32, Theorem 8.9] we know that there is close relation between the subdifferentials of at and the normal cones of its epigraph at . Also, from [32, Exercise 8.14],
[TABLE]
In the sequel, we call a point at which (respectively, ) is called a limiting (respectively, regular) critical point of . By [32, Theorem 10.1], a local minimizer of is necessarily a regular critical point of , and then a limiting critical point.
2.2 Lipschitz-like properties of multifunctions
Let be a given multifunction. Consider an arbitrary point at which is locally closed, where denotes the graph of . We recall from [32, 6] the concepts of the Aubin property, calmness and metric subregularity of .
Definition 2.1
The multifunction is said to have the Aubin property at for with modulus , if there exist and such that for all ,
[TABLE]
Definition 2.2
The multifunction is said to be calm at for with modulus if there exist and such that for all ,
[TABLE]
If in addition , is said to be isolated calm at for .
By [6, Exercise 3H.4], the restriction on in Definition 2.2 can be removed. It is easily seen that the calmness of is a “one-point” variant of the Aubin property, and the calmness of at is implied by its Aubin property or isolated calmness at this point. Notice that the calmness of at for is equivalent to the metric subregularity of at for by [6, Theorem 3H.3].
The coderivative and graphical derivative of are an convenient tool to characterize the Aubin property and the isolated calmness of , respectively. Recall from [32] that the coderivative of at for is the mapping defined by
[TABLE]
and the graphical derivative of at for is the mapping given by
[TABLE]
Lemma 2.1
(See [25, Theorem 5.7] or [32, Theorem 9.40]) Suppose that is locally closed at . Then has the Aubin property at for iff .
Lemma 2.2
(See [14, Proposition 2.1] or [18, Proposition 4.1]) Suppose that is locally closed at . Then is isolated calm at for iff .
2.3 Coderivative of the subdifferential mapping
For a given with SVD as , by [35, Example 2] we have
[TABLE]
where and are the submatrix consisting of the first columns of and , respectively, and and are the submatrix consisting of the last columns and columns of and , respectively. In this part we recall from [22] the coderivative of the subdifferential mapping . For this purpose, in the sequel for two positive integers and with , we denote by the set . For a given , define the following index sets associated to its singular values:
[TABLE]
and let and be the matrices associated to given by
[TABLE]
With the matrices and , we define the following matrices
[TABLE]
For the index set , we denote the set of all partitions of by . Define the set
[TABLE]
For any , let denote the first generalized divided difference matrix of at , which is defined as
[TABLE]
Write \mathcal{U}_{|\beta|}:=\big{\{}\overline{\Omega}\in\mathbb{S}^{|\beta|}\!:\ \overline{\Omega}=\lim_{k\to\infty}D(z^{k}),\,z^{k}\to e_{|\beta|},\,z^{k}\in\mathbb{R}_{>}^{|\beta|}\big{\}}. For each , by equation (13) there exists a partition such that
[TABLE]
where each entry of belongs to . Let be the matrix associated to :
[TABLE]
Now we are in a position to give the coderivative of the subdifferential mapping .
Lemma 2.3
(See [22, Theorem 3.2]) Fix an arbitrary and let and be defined by (10a)-(10b) with . Let with where and , and for each write and . Then, iff the following relations hold
[TABLE]
where and are linear the mappings defined by
[TABLE]
and the notation “” denotes the Hardmard product operator of two matrices.
3 Four classes of stationary points and their relations
To introduce the four classes of stationary points for the problem (1), with each , we write for and for ; and with the associated , write for and for . Clearly, and are absolutely symmetric, i.e., and for any signed permutation matrix . Also, is globally Lipschitz continuous over the ball . The following equivalent relations are often used in the subsequent analysis
[TABLE]
3.1 R-stationary point
Recall that is a regular critical point of if . Since the rank function is regular by [37, Lemma 2.1] and [19, Corollary 7.5], by combining with the assumption on , from [32, Corollary 10.9] we have . In view of this, we introduce the following R-stationary point of the problem (1).
Definition 3.1
A matrix is called a R-stationary point of the problem (1) if
[TABLE]
Remark 3.1
Clearly, every R-stationary point of (1) is a regular critical point of . By the given assumption on and [32, Exercise 10.10], for any it holds that
[TABLE]
Thus, when , the limiting critical point of is same as its regular critical point, and coincides with the R-stationary point of (1).
3.2 M-stationary point
By invoking the relation (18b), clearly, the MPEC (1) can be compactly written as
[TABLE]
Moreover, under a suitable constraint qualification (CQ), the following inclusion holds:
[TABLE]
Motivated by this, we introduce the M-stationary point of the problem (1) as follows.
Definition 3.2
A matrix is called an M-stationary point of the problem (1) associated to if there exist and such that
[TABLE]
Remark 3.2
When , the rank regularized problem (1) can be reformulated as
[TABLE]
Notice that and iff and . So, for this case, is an M-stationary point if and only if there exist with and such that
[TABLE]
or equivalently, there exist with and such that
[TABLE]
For this class of stationary points, we have the following proposition that is the key to achieve the relation between the M-stationary point and the R-stationary point.
Proposition 3.1
Let denote the family of those that is differentiable on . If is an M-stationary point of the problem (1) associated to , then there exist and such that for the index sets and defined as in (10a)-(10b) with and ,
[TABLE]
In particular, if for all , then ; and if , then .
Proof: Let be an M-stationary point of the problem (1) associated to . By Definition 3.2, there exist and such that (20) holds. So, there exists such that . We argue that has the form of (23). Since , from ,
[TABLE]
Since is absolutely symmetric and , by [20, Corollary 2.5] and equation (24b) there exist and such that
[TABLE]
From , the definition of and equation (24b), it follows that
[TABLE]
Without loss of generality, we assume that the matrix has distinct singular values belonging to . Let be the distinct singular values and write
[TABLE]
Since , from equation (24b) and [4, Proposition 5], there exist a block diagonal matrix with and for , and orthogonal matrices and such that
[TABLE]
Together with equations (25) and (26), it is not difficult to obtain that
[TABLE]
and consequently
[TABLE]
Since , by equation (16a)-(16b) of Lemma 2.3, we get
[TABLE]
where , and the matrices and are defined as in Section 2.3. Notice that is a diagonal matrix by equation (27). Together with (28a)-(28b) and (11c)-(11i), it follows that
[TABLE]
Notice that (29b) is equivalent to which, by the fact that the entries of belongs to , implies that . Notice that equations (29c) and (29d) can be equivalently written as
[TABLE]
Since and , by imposing the transpose to the both sides of equality (30b) we immediately obtain that
[TABLE]
where “” denotes the entries division operator of two matrices. Substituting this equality into (30a) yields that , and then . Similarly, from (29e) and (29f), we can obtain and . Thus,
[TABLE]
Thus, to complete the proof of the first part, we only need to argue that . Since , by (16f) there exist and having the form (14) for some partition of such that
[TABLE]
where the matrix associated with has the form of (15). From (27) and the first equality in (26), . Notice that by (2). We deduce from the second inequality of (32). Since , (31) reduces to
[TABLE]
Since , by using the expressions of and we have , and then the last equality reduces to 0=\mathcal{S}\big{[}Q^{\mathbb{T}}(\Delta\widetilde{\Gamma})_{\beta\beta}Q\big{]}=\mathcal{S}[(\Delta\widetilde{\Gamma})_{\beta\beta}]. Thus, we complete the proof of the first part. By combining with (27) and (26), it is easy to see that if for any , then ; and if , then .
Now we state the relation between the M-stationary point and the R-stationary point.
Theorem 3.1
If is an M-stationary point of the problem (1) associated to , then it is also a R-stationary point. Conversely, if is a R-stationary point of (1), then it is an M-stationary point associated to those with .
Proof: Let be an M-stationary point of (1) associated to . By Proposition 3.1, there exist and such that for the index sets defined as in (10a)-(10b) with and , the matrix takes the form of (23). Let Take . Write and . Then,
[TABLE]
By the definitions of and and (24a), it is easy to check that . Notice that . From [17, Theorem 4], we have . Thus, . From Definition 3.1, is a R-stationary point.
Now let be a R-stationary point of (1) with . Suppose that . Take with . By Definition 3.1, there is such that . Along with [17, Theorem 4], there exists such that
[TABLE]
Next we proceed the arguments by and , where is same as in (2).
Case 1: . Take , where and are the matrix consisting of the first columns of and , respectively. Clearly, and with . Let be defined as before. Clearly, . Take
[TABLE]
Since is convex, from [32, Proposition 10.19(i)] it follows that for . Then . Let and . Clearly, where and with being the matrix consisting of the first columns of . Together with and defined as in Section 2.3, it is immediate to verify that satisfies
[TABLE]
Since , from Lemma 2.3 it follows that , i.e., . By Definition 3.2, is M-stationary associated to .
Case 2: . Now . Take , where and are the matrix consisting of the last and columns of and , respectively. Clearly, and with . Let and be defined as before. Then and . Let with
[TABLE]
Using the same arguments as those for Case 1 can prove that is M-stationary.
When , choose . Clearly, since . Write . Then, . Take . Since , we have . Moreover, by Lemma 2.3 it is easy to check that Thus, is M-stationary associated to . The proof is then completed.
To close this subsection, we provide a condition for a local minimizer of the MPEC (1) associated with to be an M-stationary point associated to .
Proposition 3.2
Let be a local minimizer of the MPEC (1) associated to . Then is an M-stationary point of the problem (1) associated to , provided that
[TABLE]
where , and if in addition , is a -stationary point.
Proof: By invoking the relation (18a), is a feasible point of (1) if and only if . This implies that (1) can be compactly written as
[TABLE]
From the local optimality of , the assumption on , the Lipschitz continuity of over the ball , and [32, Theorem 10.1 Exercise 10.10], it follows that
[TABLE]
where . Together with the inclusion (36) and [32, Exercise 10.10],
[TABLE]
which is equivalent to saying that there exists such that
[TABLE]
Notice that if and only if . So, equation (37) is equivalent to saying that there exists such that
[TABLE]
In addition, notice that which is equivalent to by (18b). Thus, by Definition 3.2, is an M-stationary point of the problem (1) associated to . The second part is a direct consequence of Theorem 3.1. The proof is completed.
Remark 3.3
(i)* If , the inclusion (36) automatically holds. If , by [13, Page 211] the inclusion (36) is implied by the calmness of the following multifunction*
[TABLE]
at the origin for , where is an arbitrary feasible point of the MPEC (1).
(ii)* When , together with (3.2) and the Lipschitz continuity of in , in order to achieve the conclusion of Proposition 3.2, we need to replace the inclusion (36) by*
[TABLE]
where . By invoking **[13, Page 211]**, this inclusion is implied by the calmness of the following multifunction
[TABLE]
at the origin for , where is an arbitrary feasible point of the MPEC (3.2). By the definition of calmness, it is easy to check that the calmness of at the origin for is implied by that of in (4) with and at the corresponding point, while by Theorem 4.2 the latter holds if for any such that the following implication relation holds:
[TABLE]
For the characterization of , please refer to Appendix.
3.3 EP-stationary points
By the definition of the function , clearly, the problem (1) can be compactly written as
[TABLE]
Based on this equivalent reformulation, we introduce the following stationary point.
Definition 3.3
A matrix is said to be an EP-stationary point of the problem (1) associated to if there exist a constant and such that
[TABLE]
Remark 3.4
By the given assumption on and the Lipschitz continuity of in , if is a limiting critical point of the objective function of (43), it is an EP-stationary point of (1). Thus, every local optimal solution of (1) is an EP-stationary point of (1).
The following proposition characterizes a key property of the EP-stationary point.
Proposition 3.3
Suppose that is an EP-stationary point of (1) associated to . Then, there exist and such that , and there exists such that
[TABLE]
Proof: Since is an EP-stationary point of the problem (1), there exist a constant and a matrix such that the inclusions in (44) hold. Define the index sets
[TABLE]
Since , by [20, Corollary 2.5] there exists such that
[TABLE]
Notice that with for , for and for . Since for any , we have , and the first part follows. Since satisfies the second inclusion of (44), there exist such that . Write . From the SVD of in the last equation and equation (9), we have
[TABLE]
where and are the matrix consisting of the first columns of and , respectively, and and are the matrices consisting of the last and columns of and , respectively. Together with and , the inclusion in (45) holds. In fact, the matrix in the set of (45) has the following form
[TABLE]
for some with , where .
Remark 3.5
If is an EP-stationary point of (1) and the associated is such that , then by Definition 3.1 and [17, Theorem 4] is a R-stationary point of (1). However, when is a R-stationary point, it is not necessarily EP-stationary.
3.4 DC-stationary point
With the conjugate of , the surrogate problem (6) can be equivalently written as
[TABLE]
By [20, Lemma 2.3], we know that is also absolutely symmetric. Along with its lsc and convexity, from [20, Corollary 2.6] it follows that is an absolutely symmetric convex function on . Thus, is a DC function on . In view of this, we present the following DC-stationary point by the reformulation (46).
Definition 3.4
A matrix is called a DC-stationary point of the problem (1) associated to if there exists a constant such that
[TABLE]
When is convex, the problem (46) is a DC program, and now is a DC-stationary point if and only if it is a critical point of the objective function of (46) defined by Pang et al.[29]. It is worthwhile to point out that the limiting critical point of the objective function of (46) is a DC-stationary point, but the converse does not hold. For the discussion on the DC-stationary point, the reader may refer to [29]. Here, we focus on the relation between the DC-stationary point and the EP-stationary point.
Theorem 3.2
Let be a DC-stationary point of (1) associated to . Suppose that
[TABLE]
Then is an EP-stationary point. Conversely, if is an EP-stationary point associated to with nondecreasing on , then is necessarily a DC-stationary point.
Proof: From the symmetry of , it follows that for any . Together with the given assumption, we have for any . By the differentiability of on , clearly, is differentiable on . Along with its absolute symmetry and convexity, from [20, Theorem 3.1] it follows that is differentiable in , and consequently Since is a DC-stationary point of (1), there exists a constant such that (47) holds. Take . Let
[TABLE]
Since is a closed proper convex function, we have by [31, Section 23], which implies that for and consequently . Combining with [31, Corollary 23.5.1], we obtain
[TABLE]
where the second inclusion is due to and . By the definition of , it is not hard to obtain . Thus, by Definition 3.3 and (47), to achieve the first part we only need to argue that . Recall that for each and for all , we have for each . This along with the expression of means that .
Now suppose is a EP-stationary point associated to with nondecreasing on . Then, there exist and such that the inclusions in (44) hold. Notice that is nondecreasing and convex. Hence, is convex. Together with its absolute symmetry and convexity, it follows that is absolutely symmetric and convex. From [20, Corollary 2.5] it follows that is convex over . From , we get . By the von Neumman trace inequality, it is easy to check that , and then . Together with the second inclusion in (44) and Definition 3.4, we conclude that is a DC-stationary point of (1).
To sum up the previous discussions, we obtain the relations as shown in Figure 1, where is the index set defined as in (45) and denotes the family of those that is nondecreasing on . We see that the set of R-stationary points is almost same as that of M-stationary points and includes that of EP-stationary points under the rank condition , while for some the set of EP-stationary points coincides with that of DC-stationary points, for example, the following special .
Example 3.1
Let for . Clearly, . Also,
[TABLE]
After an elementary calculation, the conjugate and of and take the form of
[TABLE]
It is easy to check that satisfies the conditions in (48) and is nondecreasing in .
4 M-stationary point of MPSCCC
In Section 3.2, the MPEC (1) is the key to characterize the M-stationary point of (1). When , it corresponds to (3.2) which is a special case of the following MPSCCC
[TABLE]
where and are the closed sets, and are smooth functions. For this class of problems, since the Robinson CQ does not hold, it is common to seek an M-stationary point which is weaker than the classical KKT point (also called the strong stationary point). In this section, we shall provide a weaker condition for a local minimizer of (4) to be the M-stationary point. For this purpose, we need the multifunction defined as follows:
[TABLE]
By [5, Proposition 2.1 and Theorem 2.1], it is immediate to have the following result.
Theorem 4.1
Let be a local minimizer of (4). If the perturbed mapping is calm at the origin for , then is an M-stationary point of the problem (4).
By [11, Corollary 1], one may achieve the calmness of at the origin for by the directional limiting normal cone to . That is, the following result holds.
Theorem 4.2
Consider an arbitrary . If for any such that the implication holds:
[TABLE]
then the multifunction is calm at the origin for .
Remark 4.1
(i)* Notice that iff*
[TABLE]
Together with Lemma 2.2, there is no nonzero such that if and only if is isolated calmness at the origin for . Thus, Theorem 4.2 is stating that if is not isolated calm and the implication in (55) holds, then is necessarily calm at the origin for .
(ii)* Notice that if and only if*
[TABLE]
Together with Lemma 2.1, the Aubin property of is equivalent to the implication
[TABLE]
Since for , the implication in (55) is weaker than the one in (62) which is precisely the M-stationary point condition given in **[5, Theorem 6.1(i)]**. For the characterization of the directional normal cone , the reader refers to Appendix.
To close this section, we illustrate Theorem 4.2 by the following special example
[TABLE]
where , , and is the linear mapping
[TABLE]
Consider and . Write and . Clearly, . Moreover, the index sets and defined by (66) with satisfy and Fix an arbitrary with and such that , where and . Since , by the expressions of and it is not hard to obtain
[TABLE]
with and . Then . Let and satisfy the conditions on the left hand side of (55). Since , we have . Thus,
[TABLE]
Case 1: . Now we have , and the index sets and defined by (67) with satisfy and . From Theorem 1 in Appendix, it follows that if and only if
[TABLE]
Together with (64) and (65), we get and . Thus, .
Case 2: . Now we have , and consequently the index sets and defined by (67) with satisfy and . From Theorem 1 in Appendix, it follows that if and only if
[TABLE]
Together with (64) and (65), we get and . Thus, .
The above arguments show that the implication (55) holds, and then the condition in Theorem 4.2 is satisfied. Thus, the global minimizer is a M-stationary point of (4), but by [5, Theorem 6.1(i)] we can not judge whether is a M-stationary or not.
Acknowledgement This work is supported by the National Natural Science Foundation of China under project No.11571120 and No.11701186.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] S. J. Bi and S. H. Pan , Multistage convex relaxation approach to rank regularized minimizataion problems based on equivalent mathematical program with a generalized complementarity constraint , SIAM Journal on Control and Optimization, 55(2017): 2493-2518.
- 2[2] O. P. Burdakov, C. Kanzow and A. Schwartz , Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method , SIAM Journal of Optimization, 26(2016): 397-425.
- 3[3] M. A. Davenport and J. Romberg , An overview of low-rank matrix recovery from incomplete observations , IEEE Journal of Selected Topics in Signal Processing, 10(2016): 608-622.
- 4[4] C. Ding, D. F. Sun and K. C. Toh , An introduction to a class of matrix cone programming , Mathematical Programming, 144(2014): 141-179.
- 5[5] C. Ding, D. F. Sun and J. J. Ye , First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints , Mathematical Programming, 144(2014): 141-179.
- 6[6] A. L. Dontchev and R. T. Rockafellar , Implicit Functions and Solution Mappings , Springer Monographs in Mathematics, LLC, New York, 2009.
- 7[7] M. Fazel , Matrix Rank Minimization with Applications , Stanford University, Ph D thesis, 2002.
- 8[8] M. Fazel, H. Hindi and S. Boyd , Log-det heuirstic for matrix rank minimization with applications to Hankel and Euclidean distance matrices , American Control Conference, 2003. Proceedings of the 2003, 3: 2156-2162.
