نتایج جستجو برای: generalized proximal weakly g

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

Journal: :Discrete Mathematics 1997
Jean E. Dunbar Jerrold W. Grossman Johannes H. Hattingh Stephen T. Hedetniemi Alice A. McRae

Let G = (V,E) be a connected undirected graph. For any vertex v ∈ V , the closed neighborhood of v is N [v] = {v} ∪ {u ∈ V | uv ∈ E }. For S ⊆ V , the closed neighborhood of S is N [S] = ⋃ v∈S N [v]. The subgraph weakly induced by S is 〈S〉w = (N [S], E ∩ (S × N [S])). A set S is a weakly-connected dominating set of G if S is dominating and 〈S〉w is connected. The weakly-connected domination numb...

Journal: :Digestion 2010
Katsuhiko Iwakiri Hirohito Sano Yuriko Tanaka Noriyuki Kawami Mariko Umezawa Seiji Futagami Yoshio Hoshihara Tsutomu Nomura Masao Miyashita Choitsu Sakamoto

BACKGROUND AND AIM The reason that some reflux episodes evoke symptoms is poorly understood, therefore the aim of this study is to assess the determinants of reflux perception in patients with non-erosive reflux disease (NERD) on proton pump inhibitor (PPI) therapy. METHODS Ten NERD patients with persistent symptoms, despite double-dose PPI therapy, were included in this study. All patients h...

Journal: :bulletin of the iranian mathematical society 0
mohammad jelodari mamaghani professor of mathematics dept of maths and stats, allameh tabatabaei univ.

we introduce a two generated weakly branch contracting automaton group $g$ which is generated by a two state automaton on a three letter alphabet. using its branch structure and the finiteness nature of a sequence of its factor groups we compute the order of some of these factors. furthermore some algebraic properties of $g$ are detected .

Journal: :Foundations of Computational Mathematics 2021

We introduce a geometrically transparent strict saddle property for nonsmooth functions. This guarantees that simple proximal algorithms on weakly convex problems converge only to local minimizers, when randomly initialized. argue the may be realistic assumption in applications, since it provably holds generic semi-algebraic optimization problems.

Journal: :international journal of group theory 2014
sunil kumar prajapati balasubramanian sury

for a finite group $g$‎, ‎we study the total character $tau_g$‎ ‎afforded by the direct sum of all the non-isomorphic irreducible‎ ‎complex representations of $g$‎. ‎we resolve for several classes of‎ ‎groups (the camina $p$-groups‎, ‎the generalized camina $p$-groups‎, ‎the groups which admit $(g,z(g))$ as a generalized camina pair)‎, ‎the problem of existence of a‎ ‎polynomial $f(x) in mathbb...

Journal: :Annals of Global Analysis and Geometry 2019

Journal: :Journal of Global Optimization 2021

An interesting observation is that most pairs of weakly homogeneous mappings do not possess strongly monotonic property, which one the key conditions to ensure unique solvability generalized variational inequality. This paper focuses on studying uniqueness and inequality with a pair mappings. By using weaker condition than strong monotonicity some additional conditions, we achieve several resul...

Journal: :Annals of West University of Timisoara - Mathematics and Computer Science 2017

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

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