• Aucun résultat trouvé

Circular cone convexity and some inequalities associated with circular cones

N/A
N/A
Protected

Academic year: 2022

Partager "Circular cone convexity and some inequalities associated with circular cones"

Copied!
17
0
0

Texte intégral

(1)

R E S E A R C H Open Access

Circular cone convexity and some inequalities associated with circular cones

Jinchuan Zhou1, Jein-Shan Chen2*and Hao-Feng Hung2

*Correspondence:

jschen@math.ntnu.edu.tw

2Department of Mathematics, National Taiwan Normal University, Taipei, 11677, Taiwan

Full list of author information is available at the end of the article

Abstract

The study of this paper consists of two aspects. One is characterizing the so-called circular cone convexity offby exploiting the second-order differentiability offLθ; 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 Keywords: circular cone; convexity; determinant; trace

1 Introduction

Recently, much attention has been paid to the nonsymmetric cone optimization problems, see [–] and the references therein. Unlike symmetric cones [], there is no unified struc- ture 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 []. In gen- eral, 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 coneLθ. The circular cone [–] is a pointed closed convex cone having hyper- spherical 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

Lθ:=

x= (x,x)T∈R×Rn–|x≥ xcosθ

=

x= (x,x)T∈R×Rn–|x≥ xcotθ .

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 ofith finger is subject to a circular cone constraint, see [, ] and references for more details.

AlthoughLθis a nonsymmetric cone, we can, due to its special structure, establish the explicit form of orthogonal decomposition (or spectral decomposition) [] as

x=λ(x)·u()x +λ(x)·u()x , ()

©2013Zhou et al.; licensee Springer. This is an Open Access article distributed under the terms of the Creative Commons Attribu- tion License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

(2)

where

⎧⎨

λ(x) =x–xcotθ, λ(x) =x+xtanθ and

⎧⎪

⎪⎩

u()x =+cotθ

cotθIn–

–¯x =

sinθ –(sinθcosθ)x¯ , u()x =+tanθ

tanθIn–

¯ x =

cosθ (sinθcosθ)¯x

withx¯=x/xifx= , andx¯being any vectorwinRn–satisfyingw=  ifx= .

Clearly,xLθif and only ifλ(x)≥.

The formula () allows us to define the following vector-valued function:

fLθ(x) :=f λ(x)

u()x +f λ(x)

u()x , ()

wheref is a real-valued function fromJtoRwithJbeing a subset inR. LetSbe the set of allx∈Rnwhose spectral valuesλi(x) fori= ,  belong toJ,i.e.,S:={x∈Rn|λi(x)∈J,i=

, }. According to [], we know thatSis open if and only ifJis open. In addition, asJis an interval, thenSis convex because

min

λ(x),λ(y)

λ

βx+ ( –β)y

λ

βx+ ( –β)y

≤max

λ(x),λ(y)

, ∀β∈[, ].

Throughout this paper, we always assume thatJ is an interval inR. Clearly, asθ= , Lreduces to the second-order cone and the above expressions () and () correspond to the spectral decomposition and the SOC-function associated with the second-order cone, respectively (see [, ] for more information regardingfsoc).

It is well known that in dealing with symmetric cone optimization problems, such as second-order cone optimization problems and positive semi-definite optimization prob- lems, this type of vector-valued functions plays an essential role. Inspired by this, we study the properties offLθ, which is crucial for circular cone optimization problems. In our previous works, we have studied the smooth and nonsmooth analysis offLθ [, ];

and the circular cone monotonicity and second-order differentiability offLθ []. From the aforementioned research, there is an interesting observation: some properties com- monly shared byfsocandfLθ are independent of the angleθ; for example,fLθ is direc- tionally differentiable, Fréchet differentiable, semi-smooth if and only iff is directionally differentiable, Fréchet differentiable, semi-smooth; while some properties are dependent on the angleθ; for example,fLθ withf(t) = –/tfort>  is circular cone monotone as θ∈[, ), but not circular cone monotone asθ∈(, ).

In this paper, we further study the circular cone convexity off. More precisely, a real- valued functionf:J→Ris said to beLθ-convex of ordernonSif for anyx,yS,

fLθ

βx+ ( –β)y

Lθ βfLθ(x) + ( –β)fLθ(y), ∀β∈[, ].

(3)

The characterization ofLθ-convexity is based on the observation thatfisLθ-convex if and only if (fLθ)(x)(h,h)Lθfor allh∈Rn. Our result shows that the circular cone convexity requires that the angleθ belongs in [, ). In particular, we show thatf isLθ-convex of order  if and only ifθ∈[, ) andf is convex.

On the other hand, using the spectral decomposition (), we define thedeterminantand traceofxin the framework of circular cone as

det(x) :=λ(x)λ(x) and tr(x) :=λ(x) +λ(x),

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 [–

]. Here we further study some basic inequalities ofdet(x) andtr(x) in the framework of circular cone. As seen in Section , 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, forx,yLθ, the inequality

det(e+x+y)≤det(e+x)det(e+y),

wheree= (, , . . . , )∈Rn, 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 Rn the n- dimensional Euclidean space and by R+ the set of all nonnegative real scalars, i.e., R+={t∈R|t≥}. For x,y∈Rn, the inner product is denoted byxTy. LetSn mean the spaces of all real symmetric matrices inRn×n, and letSn+denote the cone of positive semi-definite matrices. We writexLθ yto stand forxyLθ. Finally, we define :=  for convenience.

2 Circular cone convexity

The main purpose of this section is to provide characterizations ofLθ-convex functions.

First, we need the following technical lemma.

Lemma . Givenαi∈Rfor i= , . . . , andβi∈Rfor i= , , ,we define

F(β,β,β) :=αβ+αβ+αββ+αββ+αββ+αβββ. () IfF,β,β)≥for all,β,β)∈R,then

α≥, α≥, α≥, α≥, α≥–√ αα. Furthermore,if

α

⎧⎨

αα forα≥,

[α– (α/α)]α forα∈[–√

αα, ), ()

thenF(β,β,β)≥for all,β,β)∈R.

(4)

Proof If β = , thenF,β,β) =ββ+αβ]. From F(β,β,β)≥, we have αβ+αβ≥. Thus,α≥ by lettingβ→ andα≥ by lettingβ→.

Ifβ= , thenF,β,β) =ββ+αβ]. FromF,β,β)≥, we obtainα≥ andα≥.

Ifβ= , then

F(β,β,β) =αβ+αβ+αββ=ββ

α β

β

+α+α β

β

() wheneverβ=  andβ= . Lett=β. FromF(β,β,β)≥, equation () implies

α≥–αtα

/t

, ∀t= , i.e.,

α≥max

t=

–αtα

/t

= –min

t=

αt+α

/t

= –√ αα. Furthermore, ifα≥, then

F(β,β,β)≥αβ+αββ+αβββ=

β ββ

α α/

α/ α β ββ

≥,

where the last step is due to

α α/

α/ α

S+O,

which is ensured by condition (). Similarly, ifα∈[–√αα, ) (implyingα=  in this case), then

F(β,β,β)

= √

αβ+ α

√αβ

+

αα

α

β+αββ+αββ+αβββ

αα

α

β+αββ+αβββ

=

β ββ

α– (α/α) α/

α/ α β ββ

≥,

where the last step is due to

α– (α/α) α/

α/ α

S+O,

which is ensured by condition () and the factα– (α/α)≥ since –√ααα< .

This completes the proof.

Lemma .[, Theorem .] Let f :J→Rand fLθbe defined as in().Then fLθis second- order differentiable at xS if and only if f is second-order differentiable atλi(x)∈J for

(5)

i= , .Moreover,for u,v∈Rn,if x= ,then fLθ

(x)(u,v)

=

⎧⎪

⎪⎩ f(x)

uTv

uv+vu , either u= or v= , f(x)uTv

f(x)(vu+uv)+f(x)(tanθ–cotθ)(uvuT¯vvu) , otherwise.

If x= ,then fLθ

(x)(u,v) =

I

I

,

where

I:=vuξ˜+˜

ux¯Tv+vx¯Tu

+av˜ Tu+ (η˜–a)¯˜ xTvx¯Tu, I:=

(η˜–a)u˜ x¯Tv+ ( – d)¯˜ xTvx¯Tu+v˜ u+ (η˜–a)v˜ x¯Tu

x¯

+d˜

¯

xTuv+vTux¯+x¯Tvu

+a(u˜ v+vu)

with

˜

a=f(x)) –f(x)) λ(x) –λ(x) , ξ˜= f(x))

 +cotθ +f(x))

 +tanθ,

˜

= – cotθ

 +cotθf λ(x)

+ tanθ

 +tanθf λ(x)

,

˜

η= cotθ

 +cotθf λ(x)

+ tanθ

 +tanθf λ(x)

, d˜= 

x

cotθ

 +cotθf λ(x)

+ tanθ

 +tanθf λ(x)

f(x)) –f(x)) λ(x) –λ(x)

,

= – cotθ

 +cotθf λ(x)

+ tanθ

 +tanθf λ(x)

.

The characterization ofLθ-convexity is established below, which can be regarded as the extension of some results given in [, –] from the second-order cone setting to the circular cone setting.

Theorem . Suppose that f :J→Ris second-order continuously differentiable.If f is Lθ-convex of order n on S,thentanθ≥,f is convex on J,and for allτ,τJ withττ,

f)δ(τ,τ)≥ 

τ)δ(τ,τ) ()

and

tanθ δ(τ,τ) +

tanθ– 

δ(τ,τ)

f) – 

τ)δ(τ,τ)

≥–f)

tanθ– 

δ(τ,τ)

tanθ δ(τ,τ) +

tanθ– 

δ(τ,τ)

. ()

(6)

Furthermore,if tanθ δ(τ,τ) +

tanθ– 

δ(τ,τ)

f)≥ 

τ)δ(τ,τ) () and

δ(τ,τ)δ(τ,τ)

tanθ δ(τ,τ) +

tanθ– 

δ(τ,τ)

f)f)(ττ), () or if

tanθ δ(τ,τ) +

tanθ– 

δ(τ,τ)

f) < 

τ)δ(τ,τ) and

δ(τ,τ)δ(τ,τ)

tanθ–  f)

tanθ–  f)

tanθ δ(τ,τ) +

tanθ– 

δ(τ,τ)

δ(τ,τ)

tanθ δ(τ,τ) +

tanθ– 

δ(τ,τ)

f) – 

τ)δ(τ,τ)

×f)(ττ), ()

then f isLθ-convex.Hereδ(τ,τ) :=f(τ) –f) –f)(τ–τ)forτ,τJ.

Proof According to [, Theorem .],f isLθ-convex if and only if (fLθ)(x)(h,h)Lθfor allxSandh∈Rn. We proceed the proof by considering the following three cases.

Case . Forx=  andh= , it follows from Lemma . that fLθ

(x)(h,h) =f(x) h

.

Hence, (fLθ)(x)(h,h)Lθif and only iff(x)≥.

Case . Forx=  andh= , it follows from Lemma . that fLθ

(x)(h,h) =

f(x)h

f(x)hh+f(x)(tanθ–cotθ)hh

.

Hence, (fLθ)(x)(h,h)Lθif and only iff(x)≥ and tanθh≥h+ (tanθ–cotθ)hh, i.e.,

–tanθ

h+h

h+ (tanθ–cotθ)h

h ≤tanθ

h+h .

(7)

Dividing byhand lettingt=h/hyields –tanθ

t+ 

≤t+tanθ–cotθ≤tanθ t+ 

⇐⇒ max

t∈R –tanθ t+ 

– t≤tanθ–cotθ≤min

t∈Rtanθ t+ 

– t

⇐⇒ cotθ–tanθ≤tanθ–cotθ≤tanθ–cotθ

⇐⇒ tanθ≥.

Case . Forx= , due to the simplification of notation, let us denote μ:=h–cotθx¯Th, μ:=h+tanθx¯Th, μ:=

h

¯ xTh

. ()

Then

¯

xTh= μμ

tanθ+cotθ and h=tanθ μ+cotθ μ

tanθ+cotθ . ()

Note thatμ,μ, andμcan take any value inR×R×R+by taking a suitable value ofh (because the vectorhhasnvariables). It follows from Lemma . that

fLθ (x)(h,h)

=

ξ˜h+ ¯˜xThh+a˜h+ (η˜–a)(¯˜ xTh)

[( – d)(˜ x¯Th)+ (η˜–a)˜ x¯Thh]x¯+ [h˜ +d˜h]x¯+ [ah˜ +d˜x¯Th]h

=:

x¯+h

,

where

=ξ˜h+ ˜x¯Thh+ah˜ + (η˜–a)˜

¯ xTh

, = ( – d)˜

¯ xTh

+ (η˜–a)˜ x¯Thh+h˜ +d˜h, = 

˜

ah+˜xTh

.

Hence, (fLθ)(x)(h,h)Lθis equivalent to ≥ and tanθx¯+h. Note that

= 

 +cotθf λ(x)

h– 

¯ xTh

hcotθ+

¯ xTh

cotθ

+ 

 +tanθf λ(x)

h+ 

¯ xTh

htanθ+

¯ xTh

tanθ +a˜

h

¯ xTh

= 

 +cotθf λ(x)

μ+ 

 +tanθf λ(x)

μ+˜ . ()

(8)

We now claim that≥ for allh∈Rnif and only if f

λ(x)

≥, f λ(x)

≥, and a˜≥. () The sufficiency is clear. Let us show the necessity. In particular, choosingh= (–tanθ,x¯) yieldsμ=  andμ= . It then follows from≥ that f(x))≥. If we choose h= (cotθ,x¯), then we havef(x))≥. Finally, choosingh= (,kz) withk∈R,z=  andzTx¯=  gives

= f(x))

 +cotθ +f(x))

 +tanθ +ak˜ ≥.

Dividing byk both sides and taking the limits ask→ ∞, we obtaina˜≥. Sinceλi(x) can take an arbitrary value inJ, it is clear that () is equivalent to saying thatf(τ)≥ for allτJ,i.e.,f is convex onJ. Indeed, the conditiona˜≥ is ensured by the fact that

˜

a=fλ(x))–f(x))

(x)–λ(x) =f(t)≥ for somet∈(λ(x),λ(x)).

Now we calculate the values ofand, respectively.

= – cotθ

 +cotθf λ(x)

μ+ tanθ

 +tanθf λ(x)

μ +˜ – d˜x¯Th+ah˜

¯ xTh

= – cotθ

 +cotθf λ(x)

μ+ tanθ

 +tanθf λ(x)

μ+˜

¯ xTh

. ()

Meanwhile, it follows from () that = 

˜

atanθ μ+cotθ μ

tanθ+cotθ +d˜ μμ tanθ+cotθ

= 

tanθ+cotθ

μ(a˜tanθd) +˜ μacotθ+d)˜

. ()

Note that

x¯+h=+ x¯Th+h

=+ x¯Th+ μ+

¯ xTh

=

+x¯Th

+μ. ()

Putting () and ()-() together, the condition tanθx¯ +h can be rewritten equivalently as

tanθ

f(x))

 +cotθμ+f(x))

 +tanθμ+˜

– cotθ

 +cotθf λ(x)

μ+ tanθ

 +tanθf λ(x)

μ+˜

+ 

(tanθ+cotθ)

μatanθ–d) +˜ μ(a˜cotθ+d)˜

μ,

(9)

i.e.,

tanθ–  f

λ(x)

μ+ (tanθ+cotθ)

˜

atanθd˜ μ + 

(tanθ+cotθ)

˜

atanθ+d˜ f

λ(x)

– (a˜tanθd)˜ μμ + 

(tanθ+cotθ)(a˜tanθd)f˜ λ(x)

– (a˜cotθ+d)˜ μμ + 

tanθ+  f

λ(x) f

λ(x) μμ

– (a˜tanθd)(˜˜ acotθ+d)μ˜ μμ≥. ()

To apply Lemma ., we need to compute each coefficient in (). By calculation, we have

˜

atanθd˜

=f(x)) –f(x))

λ(x) –λ(x) tanθ–  x

cotθ

 +cotθf λ(x)

+ tanθ

 +tanθf λ(x)

+ 

x

f(x)) –f(x)) λ(x) –λ(x)

=f(x)) –f(x))

λ(x) –λ(x) tanθ–  x

cotθ tanθ+cotθf

λ(x)

+ tanθ tanθ+ctanθf

λ(x)

+ 

x

f(x)) –f(x)) λ(x) –λ(x)

= –tanθ+ctanθ λ(x) –λ(x)f

λ(x)

+ tanθ+ctanθ(x) –λ(x)]

f λ(x)

f λ(x)

=(tanθ+cotθ)[f(λ(x)) –f(x)) –f(x))(λ(x) –λ(x))]

(x) –λ(x)]

= tanθ+cotθ(x) –λ(x)]δ

λ(x),λ(x) ,

where the third equation follows from the factλ(x) –λ(x) = (tanθ+ctanθ)x. Similarly, we have

˜ atanθ+d˜

=(tanθ+cotθ)[f(x)) –f(x)) + (tanθ+cottanθθf(x)) +cottanθ+cotθ–tanθθf(x)))(λ(x) –λ(x))]

(x) –λ(x)]

= tanθ+cotθ(x) –λ(x)]

tanθ tan+δ

λ(x),λ(x)

+tanθ–  tanθ+ δ

λ(x),λ(x) ,

˜

acotθ+d˜=(tanθ+cotθ)[f(λ(x)) –f(x)) –f(x))(λ(x) –λ(x))]

(x) –λ(x)]

= tanθ+cotθ(x) –λ(x)]δ

λ(x),λ(x) ,

˜

atanθ+d˜

=(tanθ+cotθ)[f(x)) –f(x)) – [tanθf(x)) + ( –tanθ)f(x))](λ(x) –λ(x))]

(x) –λ(x)]

= tanθ+cotθ(x) –λ(x)]

tanθ δ

λ(x),λ(x) +

tanθ–  δ

λ(x),λ(x) .

(10)

Corresponding each coefficient in () to (), we know

⎧⎪

⎪⎪

⎪⎪

⎪⎪

⎪⎪

⎪⎪

⎪⎪

⎪⎪

⎪⎨

⎪⎪

⎪⎪

⎪⎪

⎪⎪

⎪⎪

⎪⎪

⎪⎪

⎪⎪

α= (tanθ– )f(x)), α= (tanθ+cotθ)

(x)–λ(x)]δ(λ(x),λ(x))[tantanθ+θδ(λ(x),λ(x)) +tantanθ–θ+δ(λ(x),λ(x))], α= (tanθ+cotθ)

(x)–λ(x)]{[tanθ δ(λ(x),λ(x)) + (tanθ– )δ(λ(x),λ(x))]f(x)), – δ(λ(x),λ(x))

(x)–λ(x)]}, α= (tanθ+cotθ)

(x)–λ(x)][δ(λ(x),λ(x))f(x)) – δ(λ(x),λ(x))

(x)–λ(x)]], α= (tanθ+ )f(x))f(x)),

α= –(tanθ+cotθ)

(x)–λ(x)]δ(λ(x),λ(x))δ(λ(x),λ(x)).

In view of Lemma ., the conditionα≥ meanstanθ≥,α,α≥ is ensured by the convexity off(see ()),α≥ corresponds to (), andα≥–√

ααcorresponds to ().

In addition, condition () takes the special form () and (), respectively.

Theorem . Suppose that f :J→Ris second-order continuously differentiable.Then f isLθ-convex of orderon S if and only iftanθ≥and f is convex on J.

Proof The necessity is clear from Theorem .. For sufficiency, note that in ()μ=  sincex¯=± in this case. Hence, () takes the form of

tanθ–  f

λ(x)

μ+ 

tanθ+  f

λ(x) f

λ(x)

μμ≥ for allμandμ, which is equivalent to verifying

tanθ≥ and f λ(x)

f λ(x)

≥.

This is ensued by the conditions thattanθ≥ andf is convex on J. Thus, the proof is

complete.

If, in particular,θ = , then () and () reduce to [, () in Proposition .]; () re- duces to [, () in Proposition .]. In addition, due to (), () holds automatically in this case. The above results indicate that theLθ-convexity is dependent on the properties off and the angleθ together.

3 Inequalities associated with circular cone

In this section, we establish some inequalities associated with circular cone, which we be- lieve will be useful for further analyzing the properties offLθand proving the convergence of interior point methods for optimization problems involved in circular cones.

In [], the author establishes the following results in the framework of second-order cone. More specifically, forxL◦  andyL◦ , then

(a) det(e+x)/≥ +det(x)/, (b) det(x+y)≥det(x) +det(y),

(c) det(αx+ ( –α)y)αdet(x) + ( –α)det(y),∀α∈[, ], (d) det(e+x+y)≤det(e+x)det(e+y),

(11)

(e) IfxL yL , thendet(x)≥det(y),tr(x)≥tr(y), andλi(x)≥λi(y)fori= , , (f ) tr(x+y) =tr(x) +tr(y)anddet(γx) =γdet(x)for allγ∈R.

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 . Let x= (x,x)∈R×Rn–possess spectral factorization associated with cir- cular cone given as in().Then

(a) [det(e+x)]/≥ +det(x)/for allxLθ; (b) IfxLθ y,thenλ(x)≥λ(y).

Proof (a) Note thatdet(x)≥ anddet(e+x)≥ sincex,x+eLθ. Therefore, det(e+x)/

≥ +det(x)/

⇐⇒ det(e+x)≥ + det(x)/+det(x)

⇐⇒ λ(e+x)λ(e+x)≥ + 

λ(x)λ(x) +λ(x)λ(x)

⇐⇒

x+  –xcotθ

x+  +xtanθ

≥ + 

λ(x)λ(x) +λ(x)λ(x)

⇐⇒

λ(x) + 

λ(x) + 

≥ + 

λ(x)λ(x) +λ(x)λ(x)

⇐⇒ λ(x)λ(x) +λ(x) +λ(x) + ≥ + 

λ(x)λ(x) +λ(x)λ(x)

⇐⇒ λ(x) +λ(x)≥

λ(x)λ(x)

⇐⇒ λ(x) +λ(x)

 ≥

λ(x)λ(x).

Hence, to prove the desired result, it suffices to show that λ(x) +λ(x)

 ≥

λ(x)λ(x),

which is clearly true by the arithmetic mean-geometric mean (AM-GM) inequality.

(b) SincexyLθ, we know xy≥ xycotθ≥

x–y cotθ,

i.e.,λ(x) =x–xcotθy–ycotθ=λ(y).

Theorem . Let x= (x,x)∈R×Rn–possess spectral factorization associated with cir- cular cone given as in().Then the following hold.

(a) For allx,yLθ,

det(x+y)≥det(x) +det(y) +

x+y

cscθx+y

secθ. In particular,whenθ∈(, ],we have

det(x+y)≥det(x) +det(y). ()

Références

Documents relatifs

Using the latter gen- eralized theorem, we derive second-order necessary conditions for a feasible solution to be an efficient solution to a multiobjective optimization problem..

For this functional, together with the existence of a solution, we prove some global properties for the optimal set: it has to lie at a finite distance from D (in particular the

We study the problem of the existence and nonexistence of positive solutions to the superlinear second-order divergence type elliptic equation with measurable coefficients −∇ · a ·

Keywords: Cone-convex set function, vector optimization, cone-optimal solution, proper cone- optimal solution, primai problem, dual

Let X be an orientable hyperbolic cone-3-manifold of finite volume with cone-angles ≤ π, at most finitely many ends which are (smooth or singular) cusps with compact cross-sections

(i) spectral factorization associated with circular cones; (ii) smooth and nonsmooth analysis for f L θ given as in (7); (iii) the so-called L θ -convexity; and (iv) L θ

For example, the projection formula onto a cone facilitates designing algorithms for solving conic programming problems [–]; the distance formula from an element to a cone is

It is well known that second-order cone (SOC) programming can be regarded as a special case of positive semidefinite programming using the arrow matrix.. This paper further studies