The monotonicity of the least squares mean on the Riemannian manifold of positive definite matrices, conjectured by Bhatia and Holbrook and one of key axiomatic properties of matrix geometric means, was recently established based on the Strong Law of Large Number [14, 4]. A natural question concerned with the S.L.L.N is so called the no dice conjecture. It is a problem to make a construction of...

In this paper, we investigate the issue of error bounds for symmetric cone complementarity problems (SCCPs). In particular, we show that the distance between an arbitrary point in Euclidean Jordan algebra and the solution set of the symmetric cone complementarity problem can be bounded above by some merit functions such as FischerBurmeister merit function, the natural residual function and the ...

For a closed cone C in Rn, the completely positive cone of C is the convex cone K in Sn generated by {uuT : u ∈ C}. Completely positive cones arise, for example, in the conic LP reformulation of a nonconvex quadratic minimization problem over an arbitrary set with linear and binary constraints. Motivated by the useful and desirable properties of the nonnegative orthant and the positive semidefi...

Let L be a linear transformation on a finite dimensional real Hilbert space H and K be a closed convex cone with dual K in H . The cone spectrum of L relative to K is the set of all real λ for which the linear complementarity problem x ∈ K, y = L(x)− λx ∈ K, and 〈x, y〉 = 0 admits a nonzero solution x. In the setting of a Euclidean Jordan algebra H and the corresponding symmetric cone K, we disc...

We construct the covariant κ-symmetric superstring action for type IIB superstring on plane wave space supported by Ramond-Ramond background. The action is defined as a 2d sigma-model on the coset superspace. We fix the fermionic and bosonic light-cone gauges in the covariant Green-Schwarz superstring action and find the light-cone string Lagrangian and the Hamiltonian. The resulting light-cone...

We generalize primal-dual interior-point methods for linear programming problems to the convex optimization problems in conic form. Previously, the most comprehensive theory of symmetric primal-dual interior-point algorithms was given by Nesterov and Todd 8, 9] for the feasible regions expressed as the intersection of a symmetric cone with an aane subspace. In our setting, we allow an arbitrary...

Elementary symmetric polynomials can be thought of as derivative polynomials of En(x) = ∏ i=1,...,n xi. Their associated hyperbolicity cones give a natural sequence of relaxations for R+. We establish a recursive structure for these cones, namely, that the coordinate projections of these cones are themselves hyperbolicity cones associated with elementary symmetric polynomials. As a consequence ...

In this work, we propose a proximal algorithm for unconstrained optimization on the cone of symmetric semidefinite positive matrices. It appears to be the first in the proximal class on the set of methods that convert a Symmetric Definite Positive Optimization in Nonlinear Optimization. It replaces the main iteration of the conceptual proximal point algorithm by a sequence of nonlinear programm...

In this paper, we establish at least two symmetric positive solutions for the system of higher order two-point boundary value problems on symmetric time scales by determining growth conditions and applying fixed point theorem in cone under suitable conditions. At the end of the paper, as an application, we demonstrate our results with examples. AMS subject classifications: 39A10, 34B15, 34A40.

In this paper, we give an exact expression for Clarke generalized Jacobian of the projection onto symmetric cones, which is linked to rank-1 matrices. As an application, we employ the projection operator to design a semismooth Newton algorithm for solving nonlinear symmetric cone programs. The algorithm is proved to be locally quadratically convergent without assuming strict complementarity of ...