Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 8

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  convex cone
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote On infinite dimensional generalization of Yan's theorem
100%
2
Content available remote Linearly additive random fields with independent increments on time like curves
100%
EN
Let V be a convex cone in Rn. A curve L = {l(t); t ∈ R+} ⊂ Rn is called a time-like curve if {l(s); s ≥ t} ⊂ l(t) + V holds for any t. A random field {X(t); t ∈ Rn} whose restriction X|L(t) = X (l(t)) on time-like curve L becomes an additive process is considered and it is characterized as a set-indexed random field on the dual cone V∗.
3
Content available remote Zero-one completely positive matrices and the A(R, S) classes
100%
EN
A matrix of the form A = BBT where B is nonnegative is called completely positive (CP). Berman and Xu (2005) investigated a subclass of CP-matrices, called f0, 1g-completely positive matrices. We introduce a related concept and show connections between the two notions. An important relation to the so-called cut cone is established. Some results are shown for f0, 1g-completely positive matrices with given graphs, and for {0,1}-completely positive matrices constructed from the classes of (0, 1)-matrices with fixed row and column sums.
4
Content available remote Extensions of convex functionals on convex cones
100%
EN
We prove that under some topological assumptions (e.g. if M has nonempty interior in X), a convex cone M in a linear topological space X is a linear subspace if and only if each convex functional on M has a convex extension on the whole space X.
EN
In this paper, we consider a set-valued minimax fractional programming problem (MFP), where the objective as well as constraint maps are set-valued. We introduce the notion of ρ- cone arcwise connectedness of set-valued maps as a generalization of cone arcwise connected set-valued maps. We establish the sufficient Karush-Kuhn-Tucker (KKT) conditions for the existence of minimizers of the problem (MFP) under ρ-cone arcwise connectedness assumption. Further, we study the Mond-Weir (MWD), Wolfe (WD), and mixed (MD) types of duality models and prove the corresponding weak, strong, and converse duality theorems between the primal (MFP) and the corresponding dual problems under ρ-cone arcwise connectedness assumption.
6
Content available remote Functions preserving a cone preorder and their duals
75%
EN
In this paper isotone functions and their dual cones are studied. Special attention is devoted to functions preserving cone preorders. This isotonicity is characterized by integral inequalities. The result yields some generators of dual cones of isotone functions. As an application a generalization of Steffensen Inequality is given.
EN
In this paper isotone functions and their dual cones are studied. Special attention is devoted to functions preserving cone preorders. This isotonicity is characterized by integral inequalities. The result yields some generators of dual cones of isotone functions. As an application a generalization of Steffensen Inequality is given.
EN
This paper presents some variants of minimal point theorem together with corresponding variants of Ekeland variational principle. In the second part of this article, there is a discussion on Ekeland variational principle and minimal point theorem relative to it in uniform spaces. The aim of these series of important results is to highlight relations between them, some improvements and specific applications.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.