- Research
- Open access
- Published:
Circular cone convexity and some inequalities associated with circular cones
Journal of Inequalities and Applications volume 2013, Article number: 571 (2013)
Abstract
The study of this paper consists of two aspects. One is characterizing the so-called circular cone convexity of f by exploiting the second-order differentiability of ; the other is introducing the concepts of determinant and trace associated with circular cone and establishing their basic inequalities. These results show the essential role played by the angle θ, which gives us a new insight when looking into properties about circular cone.
MSC:26A27, 26B05, 26B35, 49J52, 90C33, 65K05.
1 Introduction
Recently, much attention has been paid to the nonsymmetric cone optimization problems, see [1–4] and the references therein. Unlike symmetric cones [5], there is no unified structure for nonsymmetric cones. Hence, how to tackle nonsymmetric cone optimization is still an issue. For symmetric cone optimization, the algebraic structure associated with symmetric cones, including second-order cone and positive semi-definite matrix cones, allows us to study them via exploiting the unified Euclidean Jordan algebra [5]. In general, the way to deal with nonsymmetric cone optimization depends on the feature of the associated nonsymmetric cone. In this paper, we focus on a special nonsymmetric cone, circular cone . The circular cone [6–9] is a pointed closed convex cone having hyperspherical sections orthogonal to its axis of revolution about which the cone is invariant to rotation. Let its half-aperture angle be θ with . Then, it is mathematically expressed as
Real applications of a circular cone lie in some engineering problems, for example, in the formulation for optimal grasping manipulation for multi-fingered robots, the grasping force of i th finger is subject to a circular cone constraint, see [10, 11] and references for more details.
Although is a nonsymmetric cone, we can, due to its special structure, establish the explicit form of orthogonal decomposition (or spectral decomposition) [7] as
where
and
with if , and being any vector w in satisfying if . Clearly, if and only if .
The formula (1) allows us to define the following vector-valued function:
where f is a real-valued function from J to ℝ with J being a subset in ℝ. Let S be the set of all whose spectral values for belong to J, i.e., . According to [12], we know that S is open if and only if J is open. In addition, as J is an interval, then S is convex because
Throughout this paper, we always assume that J is an interval in ℝ. Clearly, as , reduces to the second-order cone and the above expressions (1) and (2) correspond to the spectral decomposition and the SOC-function associated with the second-order cone, respectively (see [13, 14] for more information regarding ).
It is well known that in dealing with symmetric cone optimization problems, such as second-order cone optimization problems and positive semi-definite optimization problems, this type of vector-valued functions plays an essential role. Inspired by this, we study the properties of , which is crucial for circular cone optimization problems. In our previous works, we have studied the smooth and nonsmooth analysis of [8, 10]; and the circular cone monotonicity and second-order differentiability of [9]. From the aforementioned research, there is an interesting observation: some properties commonly shared by and are independent of the angle θ; for example, is directionally differentiable, Fréchet differentiable, semi-smooth if and only if f is directionally differentiable, Fréchet differentiable, semi-smooth; while some properties are dependent on the angle θ; for example, with for is circular cone monotone as , but not circular cone monotone as .
In this paper, we further study the circular cone convexity of f. More precisely, a real-valued function is said to be -convex of order n on S if for any ,
The characterization of -convexity is based on the observation that f is -convex if and only if for all . Our result shows that the circular cone convexity requires that the angle θ belongs in . In particular, we show that f is -convex of order 2 if and only if and f is convex.
On the other hand, using the spectral decomposition (1), we define the determinant and trace of x in the framework of circular cone as
respectively. In the symmetric cone setting, the concepts of determinant and trace are the key ingredients of barrier and penalty functions which are used in barrier and penalty methods (including interior point methods) for symmetric cone optimization, see [15–17]. Here we further study some basic inequalities of and in the framework of circular cone. As seen in Section 3, the obtained inequalities are classified into three categories: (i) the first class is independent of the angle (i.e., still holds in the framework of circular cone); (ii) the second class is dependent on the angle, for example, for , the inequality
where , fails as but holds as ; (iii) the third class always fails no matter what value of θ is chosen. These results give us a new insight into a circular cone and make us focus more on the role played by the angle θ.
The notation used in this paper is standard. For example, denote by the n-dimensional Euclidean space and by the set of all nonnegative real scalars, i.e., . For , the inner product is denoted by . Let mean the spaces of all real symmetric matrices in , and let denote the cone of positive semi-definite matrices. We write to stand for . Finally, we define for convenience.
2 Circular cone convexity
The main purpose of this section is to provide characterizations of -convex functions. First, we need the following technical lemma.
Lemma 2.1 Given for and for , we define
If for all , then
Furthermore, if
then for all .
Proof If , then . From , we have . Thus, by letting and by letting .
If , then . From , we obtain and .
If , then
whenever and . Let . From , equation (5) implies
i.e.,
Furthermore, if , then
where the last step is due to
which is ensured by condition (4). Similarly, if (implying in this case), then
where the last step is due to
which is ensured by condition (4) and the fact since . This completes the proof. □
Lemma 2.2 [[9], Theorem 3.1]
Let and be defined as in (2). Then is second-order differentiable at if and only if f is second-order differentiable at for . Moreover, for , if , then
If , then
where
with
The characterization of -convexity is established below, which can be regarded as the extension of some results given in [12, 18–20] from the second-order cone setting to the circular cone setting.
Theorem 2.1 Suppose that is second-order continuously differentiable. If f is -convex of order n on S, then , f is convex on J, and for all with ,
and
Furthermore, if
and
or if
and
then f is -convex. Here for .
Proof According to [[9], Theorem 3.2], f is -convex if and only if for all and . We proceed the proof by considering the following three cases.
Case 1. For and , it follows from Lemma 2.2 that
Hence, if and only if .
Case 2. For and , it follows from Lemma 2.2 that
Hence, if and only if and
i.e.,
Dividing by and letting yields
Case 3. For , due to the simplification of notation, let us denote
Then
Note that , , and can take any value in by taking a suitable value of h (because the vector h has n variables). It follows from Lemma 2.2 that
where
Hence, is equivalent to
Note that
We now claim that for all if and only if
The sufficiency is clear. Let us show the necessity. In particular, choosing yields and . It then follows from that . If we choose , then we have . Finally, choosing with , and gives
Dividing by both sides and taking the limits as , we obtain . Since can take an arbitrary value in J, it is clear that (14) is equivalent to saying that for all , i.e., f is convex on J. Indeed, the condition is ensured by the fact that for some .
Now we calculate the values of and , respectively.
Meanwhile, it follows from (12) that
Note that
Putting (13) and (15)-(17) together, the condition can be rewritten equivalently as
i.e.,
To apply Lemma 2.1, we need to compute each coefficient in (18). By calculation, we have
where the third equation follows from the fact . Similarly, we have
Corresponding each coefficient in (18) to (3), we know
In view of Lemma 2.1, the condition means , is ensured by the convexity of f (see (14)), corresponds to (6), and corresponds to (7). In addition, condition (4) takes the special form (9) and (10), respectively. □
Theorem 2.2 Suppose that is second-order continuously differentiable. Then f is -convex of order 2 on S if and only if and f is convex on J.
Proof The necessity is clear from Theorem 2.1. For sufficiency, note that in (11) since in this case. Hence, (18) takes the form of
for all and , which is equivalent to verifying
This is ensued by the conditions that and f is convex on J. Thus, the proof is complete. □
If, in particular, , then (6) and (7) reduce to [[12], (21) in Proposition 4.2]; (9) reduces to [[12], (22) in Proposition 4.2]. In addition, due to (7), (8) holds automatically in this case. The above results indicate that the -convexity is dependent on the properties of f and the angle θ together.
3 Inequalities associated with circular cone
In this section, we establish some inequalities associated with circular cone, which we believe will be useful for further analyzing the properties of and proving the convergence of interior point methods for optimization problems involved in circular cones.
In [18], the author establishes the following results in the framework of second-order cone. More specifically, for and , then
-
(a)
,
-
(b)
,
-
(c)
, ,
-
(d)
,
-
(e)
If , then , , and for ,
-
(f)
and for all .
In the following, we show that, in the framework of circular cone, the above inequalities can be classified into three categories. The first class holds independent of the angle, e.g., (a); the second class holds dependent on the angle, e.g., (b)-(e); the third class fails no matter what value of the angle is chosen, e.g., (f).
Theorem 3.1 Let possess spectral factorization associated with circular cone given as in (1). Then
-
(a)
for all ;
-
(b)
If , then .
Proof (a) Note that and since . Therefore,
Hence, to prove the desired result, it suffices to show that
which is clearly true by the arithmetic mean-geometric mean (AM-GM) inequality.
-
(b)
Since , we know
i.e., . □
Theorem 3.2 Let possess spectral factorization associated with circular cone given as in (1). Then the following hold.
-
(a)
For all ,
In particular, when , we have
-
(b)
For all and ,
In particular, when , we have
-
(c)
If and , then
(20) -
(d)
If and , then
(21)
Proof (a) Notice that
and
Then we have
Using (and hence ) gives
Thus,
which is the desired result.
When , we know . Since , i.e., and , there exist such that and . Hence,
where the last step is due to , , and since , due to .
-
(b)
The result follows from the fact that for all .
-
(c)
Since , . For , there exist two nonnegative scalars such that and . This implies
Thus, we obtain
On the other hand,
Note that and
Hence, comparing (22) and (23) yields
-
(d)
For , since and , we know
which means
This together with the fact by Part (b) in Theorem 3.1 and for (due to ) further yields
Meanwhile, we obtain
□
Here are some remarks for Theorem 3.2.
-
(i)
Inequality (19) fails when . For example, let , , and . Then and , which says .
-
(ii)
Inequality (20) fails when . For example, let , , and . Then .
-
(iii)
Inequality (21) fails when . For example, for , , and . Then , , , and .
Next, let us move from inequalities to equalities. In particular, we focus on two identities in the framework of second-order cone as below
But these two identities fail to hold in the circular cone setting no matter what value of the angle is chosen. In fact, in the second-order cone case,
Hence, (24) holds trivially. For the circular cone setting, we have
Thus, is not linear any more, i.e., ; e.g., for and , and (or ). Then
In addition, holds as but not true as ; e.g., for , , and (or ), then
The precise relationship between and is provided as below.
Theorem 3.3
Proof The result follows from the fact that
□
Note that is positively homogeneous, i.e., for all . This together with Theorem 3.3 yields the following result.
Corollary 3.1 The trace is concave as and is convex as .
These results further indicate that the angle plays an essential role for a circular cone. As in symmetric cone optimization, we believe that these inequalities about and are key ingredients in penalty and barrier functions which can be adapted in designing barrier and penalty algorithms (including interior point algorithm) for circular cone optimization. This merits our further research.
Authors’ information
The second author is a member of Mathematics Division, National Center for Theoretical Sciences, Taipei Office.
References
Matsukawa Y, Yoshise A: A primal barrier function Phase I algorithm for nonsymmetric conic optimization problems. Jpn. J. Ind. Appl. Math. 2012, 29: 499–517.
Nesterov, Y: Towards nonsymmetric conic optimization. CORE (2006)
Skajaa, A, Jørgensen, JB, Hansen, PC: On implementing a homogeneous interior-point algorithm for nonsymmetric conic optimization. DTU Informatics, Building 321 (2011)
Skajaa, A, Ye, Y-Y: A homogeneous interior-point algorithm for nonsymmetric convex conic optimization (2012, submitted manuscript)
Faraut U, Korányi A Oxford Mathematical Monographs. In Analysis on Symmetric Cones. Oxford University Press, New York; 1994.
Dattorro J: Convex Optimization and Euclidean Distance Geometry. Meboo Publishing, Palo Alto; 2005.
Zhou J-C, Chen J-S: Properties of circular cone and spectral factorization associated with circular cone. J. Nonlinear Convex Anal. 2013, 14: 807–816.
Zhou, J-C, Chen, J-S: On the vector-valued functions associated with circular cones (2013, submitted manuscript)
Zhou, J-C, Chen, J-S: Circular cone monotonicity and second order differentiability of vector-valued functions associated with circular cones (2013, submitted manuscript)
Chang Y-L, Yang C-Y, Chen J-S: Smooth and nonsmooth analysis of vector-valued functions associated with circular cones. Nonlinear Anal., Theory Methods Appl. 2013, 85: 160–173.
Ko C-H, Chen J-S: Optimal grasping manipulation for multifingered robots using semismooth Newton method. Math. Probl. Eng. 2013., 2013: Article ID 681710
Pan S-H, Chiang Y, Chen J-S: SOC-monotone and SOC-convex functions v.s. matrix-monotone and matrix-convex functions. Linear Algebra Appl. 2012, 437(5):1264–1284.
Chen J-S, Chen X, Tseng P: Analysis of nonsmooth vector-valued functions associated with second-order cone. Math. Program. 2004, 101(1):95–117.
Chen J-S, Pan S-H: A survey on SOC complementarity functions and solution methods for SOCPs and SOCCPs. Pac. J. Optim. 2012, 8(1):33–74.
Auslender A: Penalty and barrier methods: a unified framework. SIAM J. Optim. 1999, 10: 211–230.
Auslender A, Ramirez H: Penalty and barrier methods for convex semidefinite programming. Math. Methods Oper. Res. 2006, 63: 195–219.
Chang Y-L, Chen J-S: Convexity of symmetric cone trace functions in Euclidean Jordan algebras. J. Nonlinear Convex Anal. 2013, 14(1):53–61.
Chen J-S: The convex and monotone functions associated with second-order cone. Optimization 2006, 55(4):363–385.
Chen J-S, Chen X, Pan S-H, Zhang J: Some characterizations for SOC-monotone and SOC-convex functions. J. Glob. Optim. 2009, 45(2):259–279.
Chen J-S, Liao T-K, Pan S-H: Using Schur complement theorem to prove convexity of some SOC-functions. J. Nonlinear Convex Anal. 2012, 13: 421–431.
Acknowledgements
We are gratefully indebted to anonymous referees for their valuable suggestions that helped us to essentially improve the original presentation of the paper. The first author’s work is supported by the National Natural Science Foundation of China (11101248, 11271233) and Shandong Province Natural Science Foundation (ZR2010AQ026, ZR2012AM016). The second author’s work is supported by the National Science Council of Taiwan.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
All authors read and approved the final manuscript.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Zhou, J., Chen, JS. & Hung, HF. Circular cone convexity and some inequalities associated with circular cones. J Inequal Appl 2013, 571 (2013). https://doi.org/10.1186/1029-242X-2013-571
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/1029-242X-2013-571