نتایج جستجو برای: symmetric cone
تعداد نتایج: 121536 فیلتر نتایج به سال:
In this paper, we introduce a new P -type condition for nonlinear functions defined over Euclidean Jordan algebras, and study a continuation method for nonlinear complementarity problems over symmetric cones. This new P -type condition represents a new class of nonmonotone nonlinear complementarity problems that can be solved numerically.
The basis of cross-suppression between rod and cone channels has long been an enigma. Using rabbit retinal connectome RC1, we show that all cone bipolar cell (BC) classes inhibit rod BCs via amacrine cell (AC) motifs (C1-6); that all cone BC classes are themselves inhibited by AC motifs (R1-5, R25) driven by rod BCs. A sparse symmetric AC motif (CR) is presynaptic and postsynaptic to both rod a...
The existence of closed hypersurfaces of prescribed scalar curvature in globally hyperbolic Lorentzian manifolds is proved provided there are barriers. 0. Introduction Consider the problem of finding a closed hypersurface of prescribed curvature F in a globally hyperbolic (n+1)-dimensional Lorentzian manifold N having a compact Cauchy hypersurface S0. To be more precise, let Ω be a connected op...
Let Dd,k denote the discriminant variety of degree d polynomials in one variable with at least one of its roots being of multiplicity ≥ k. We prove that the tangent cones to Dd,k span Dd,k−1 thus, revealing an extreme ruled nature of these varieties. The combinatorics of the web of affine tangent spaces to Dd,k in Dd,k−1 is directly linked to the root multiplicities of the relevant polynomials....
A common computational approach for polynomial optimization problems (POPs) is to use (hierarchies of) semidefinite programming (SDP) relaxations. When the variables in POP are required be nonnegative – as case combinatorial problems, example these SDP typically involve matrices, i.e. they conic over doubly cone. The Jordan reduction, a symmetry reduction method optimization, was recently intro...
در این پایان نامه بر مقاله ی an iterative method for the symmetric and skew symmetric solutions of a linear matrix equation axb+cyd =e نوشته ی xingping sheng و guoliang chen، مروری داشته ایم. در این مقاله دو روش تکراری برای حل معادله ی ماتریسی خطی axb+cyd=e ارائه شده است. روش اول جواب معادله را به صورت متقارن و روش دوم جواب معادله را به صورت پادمتقارن ارائه می دهد. تعدادی مثال های عددی را با...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید