نتایج جستجو برای: convex power condensing map
تعداد نتایج: 724455 فیلتر نتایج به سال:
Let $C$ be a nonempty closed convex subset of a real Banach space $E$, let $B: C rightarrow E $ be a nonlinear map, and let $u, v$ be positive numbers. In this paper, we show that the generalized variational inequality $V I (C, B)$ is singleton for $(u, v)$-cocoercive mappings under appropriate assumptions on Banach spaces. The main results are extensions of the Saeidi's Propositions for fi...
This paper presents Birkhoff-Kellogg type theorems on invariant directions for a large class of maps. A number of results which will enable to deduce results for upper semicontinuous maps which are either (a) Kakutani, (b) acyclic, (c) O’Neill, or (d) admissible (strongly) in the sense of Gorniewicz are given. The results in this paper, when the map is compact, complement and extend the previou...
This thesis examines two problems concerning the secure and reliable operation of the electric power grid. The first part studies the distributed operation of the electric power grid using the power flow problem, which is vital to the operation of the grid. The power flow problem is a feasibility problem for finding an assignment of complex bus voltages that satisfies the power flow equations a...
We prove some generalizations of the first Fredholm theorem for Hammerstein operator equations in Banach spaces and study the number of their solutions using a projection like method.The linear part is assumed to be either selfadjoint or nonseladjoint while the nonlinearities are such that the corresponding map is (pseudo) A-proper. In particular, the nonlinearities can be either of monotone ty...
Finding the most probable assignment (MAP) in a general graphical model is known to be NP hard but good approximations have been attained with max-product belief propagation (BP) and its variants. In particular, it is known that using BP on a single-cycle graph or tree reweighted BP on an arbitrary graph will give the MAP solution if the beliefs have no ties. In this paper we extend the setting...
Seeking exactness for \convex relaxation", we deene a map f : < n ! < m to be ICON if its image f(< n) is convex. Analogously, f is termed LICON(AICON) if the image of every linear (every aane) vsubspace under f is convex. In this paper, we investigate quadratic maps of these three types. These maps are motivated by a fact shown here that they prescribe conditions under which feasibility and op...
For an operator bimodule X over von Neumann algebras A ⊆ B(H) and B ⊆ B(K), the space of all completely bounded A, B-bimodule maps from X into B(K,H), is the bimodule dual of X. Basic duality theory is developed with a particular attention to the Haagerup tensor product over von Neumann algebras. To X a normal operator bimodule Xn is associated so that completely bounded A, B-bimodule maps from...
in this paper particle swarm optimization with smart inertia factor (pso-sif) algorithm is proposed to solve combined heat and power economic dispatch (chped) problem. the chped problem is one of the most important problems in power systems and is a challenging non-convex and non-linear optimization problem. the aim of solving chped problem is to determine optimal heat and power of generating u...
We consider the problem of finding the maximum area parallelogram (MAP) inside a given convex polygon. Our main result is an algorithm for computing the MAP in an n-sided polygon in O(n2) time. Achieving this running time requires proving several new structural properties of the MAP, and combining them with a rotating technique of Toussaint [10]. We also discuss applications of our result to th...
Adresa za dopisivanje Mr. sc. Walter Dukić Zavod za pedodonciju Stomatološkog fakulteta Sveučilišta u Zagrebu Gundulićeva 5, HR-10 000 Zagreb [email protected] 01/4802-132 Sažetak Kondenzirajući ostitis je patološko zadebljanje kosti u čeljustima, a karakteriziraju ga blagi klinički simptomi. Zadebljanje nastaje zbog poremećene pregradnje kosti, kao reakcija na blagu infekciju iz zubne pulpe. Ekstr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید