نتایج جستجو برای: symmetric cones

تعداد نتایج: 91975  

Journal: :Mathematical and Computer Modelling 2010
Ravi P. Agarwal Izhar Ahmad Anurag Jayswal

A pair of Mond–Weir type multi-objective higher order symmetric dual programs over arbitrary cones is formulated. Weak, strong and converse duality theorems are established under higher order K –F-convexity assumptions. Our results generalize several known results in the literature.

Journal: :Math. Program. 2003
S. H. Schmieta Farid Alizadeh

In this paper we show that the so-called commutative class of primal-dual interior point algorithms which were designed by Monteiro and Zhang for semidefinite programming extends word-for-word to optimization problems over all symmetric cones. The machinery of Euclidean Jordan algebras is used to carry out this extension. Unlike some non-commutative algorithms such as the XS+SXmethod, this clas...

Journal: :Math. Program. 2015
Dennis Amelunxen Peter Bürgisser

We express the probability distribution of the solution of a random (standard Gaussian) instance of a convex cone program in terms of the intrinsic volumes and curvature measures of the reference cone. We then compute the intrinsic volumes of the cone of positive semidefinite matrices over the real numbers, over the complex numbers, and over the quaternions in terms of integrals related to Meht...

Journal: :J. Global Optimization 2008
Alexander Engau

Based on the concept of general domination structures, this paper presents an approach to model variable preferences for multicriteria optimization and decision making problems. The preference assumptions for using a constant convex cone are given, and, in remedy of some immanent model limitations, a new set of assumptions is presented. The underlying preference model is derived as a variable d...

2016
Bruno F. Lourenço Tomonari Kitahara Masakazu Muramatsu Takashi Tsuchiya

In this work we present an extension of Chubanov’s algorithm to the case of homogeneous feasibility problems over a symmetric cone K. As in Chubanov’s method for linear feasibility problems, the algorithm consists of a basic procedure and a step where the solutions are confined to the intersection of a half-space and K. Following an earlier work by Kitahara and Tsuchiya on second order cone fea...

2008
Lingchen Kong Levent Tunçel Naihua Xiu

This paper focuses on Clarke generalized Jacobian of the projection onto symmetric cones. First, we recall some basic concepts. Let ̥ : Ω ⊆ X → Y be a locally Lipschitz function on an open set Ω, where X and Y are two finite dimensional inner product spaces over the field R. Let ∇̥(x) denote the derivative of ̥ at x if ̥ is differentiable at x. The Clarke generalized Jacobian of ̥ at x is defined by...

2009
CHEK BENG CHUA HUILING LIN PENG YI Liqun Qi Defeng Sun

Abstract. We study the uniform nonsingularity property recently proposed by the authors and present its applications to nonlinear complementarity problems over a symmetric cone. In particular, by addressing theoretical issues such as the existence of Newton directions, the boundedness of iterates and the nonsingularity of B-subdifferentials, we show that the non-interior continuation method pro...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید