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

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

2012
Ziyan Luo Jiyuan Tao Naihua Xiu

The low-rank solutions of continuous and discrete Lyapunov equations are of great importance but generally difficult to achieve in control system analysis and design. Fortunately, Mesbahi and Papavassilopoulos [On the rank minimization problems over a positive semidefinite linear matrix inequality, IEEE Trans. Auto. Control, Vol. 42, No. 2 (1997), 239-243] showed that with the semidefinite cone...

Journal: :Math. Program. 2011
Gábor Rudolf Nilay Noyan Dávid Papp Farid Alizadeh

For a proper cone K ⊂ R and its dual cone K∗ the complementary slackness condition x s = 0 defines an n-dimensional manifold C(K) in the space { (x, s) | x ∈ K, s ∈ K∗ }. When K is a symmetric cone, this fact translates to a set of n bilinear optimality conditions satisfied by every (x, s) ∈ C(K). This proves to be very useful when optimizing over such cones, therefore it is natural to look for...

2014
M. Seetharama Gowda

On the game-theoretic value of a linear transformation ona symmetric cone – p. 1/25

Journal: :Advances in Geometry 2021

Abstract The space of Euclidean cone metrics on centrically symmetric octahedra with fixed angles ?i < 2 ? , total surface area 1, has a natural hyperbolic metric, and is locally isometric to 3-space. metric completion the ideal tetrahedron whose dihedral are half cone-deficits ? .

2013
M. SEETHARAMA GOWDA R. Sznajder

For a closed cone C in R, the completely positive cone of C is the convex cone KC in S generated by {uu : u ∈ C}. Such a cone arises, 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 semidefinite cone (and ...

2017
M. Seetharma Gowda R. Sznajder M. SEETHARAMA GOWDA R. SZNAJDER

For a closed cone C in R, the completely positive cone of C is the convex cone KC in S generated by {uu : u ∈ C}. Such a cone arises, 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 semidefinite cone (and ...

2008
J. ROSS

Let Xg = C (2) g be the second symmetric product of a very general curve of genus g. We reduce the problem of describing the ample cone on Xg to a problem involving the Seshadri constant of a point on Xg−1. Using this we recover a result of Ciliberto-Kouvidakis that reduces finding the ample cone of Xg to the Nagata conjecture when g ≥ 9. We also give new bounds on the the ample cone of Xg when...

2004
Farid Alizadeh Nilay Noyan Gábor Rudolf

Consider a proper cone K ⊂ < and its dual cone K. It is well known that the complementary slackness condition xs = 0 defines an n-dimensional manifold C(K) = { (x, s) : x ∈ K, s ∈ K, xs = 0 } ⊂ <×<. When K is a symmetric cone, this manifold can be described by a set of n bilinear equalities. This fact proves to be very useful when optimizing over such cones, therefore it is natural to look for ...

2009
Nilay Noyan Dávid Papp Farid Alizadeh

For a proper cone K ⊂ Rn and its dual cone K∗ the complementary slackness condition xT s = 0 defines an n-dimensional manifold C(K) in the space { (x, s) | x ∈ K, s ∈ K∗ }. When K is a symmetric cone, this fact translates to a set of n linearly independent bilinear identities (optimality conditions) satisfied by every (x, s) ∈ C(K). This proves to be very useful when optimizing over such cones,...

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

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