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

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

2016
Christian Kanzow Daniel Steck

We deal with a generalization of the proximal-point method and the closely related Tikhonov regularization method for convex optimization problems. The prime motivation behind this is the well-known connection between the classical proximal-point and augmented Lagrangian methods, and the emergence of modified augmented Lagrangian methods in recent years. Our discussion includes a formal proof o...

1995
F. H. Clarke P. R. Wolenski R. J. Stern

A subset X of a real Hilbert space H is said to be proximally smooth provided that the function d X : H ! R (the distance to X) is continuously diierentiable on an open tube U around X. It is proven that this property is equivalent to d X having a nonempty proximal subgradient at every point of U, and that the (G^ ateaux = Fr echet) derivative is locally Lipschitz on U. The Lipschitz behavior o...

Journal: :Australasian J. Combinatorics 2017
Béla Bajnok Samuel Edwards

Let G be an abelian group of finite order n, and let h be a positive integer. A subset A of G is called weakly h-incomplete if not every element of G can be written as the sum of h distinct elements of A; in particular, if A does not contain h distinct elements that add to zero, then A is called weakly h-zero-sum-free. We investigate the maximum size of weakly hincomplete and weakly h-zero-sum-...

It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...

Journal: :Journal of Computational and Applied Mathematics 2008

2012
Yu-Lin Chang Jein-Shan Chen Jia Wu Liqun Qi JIA WU

This paper is devoted to the study of the proximal point algorithm for solving monotone and nonmonotone nonlinear complementarity problems. The proximal point algorithm is to generate a sequence by solving subproblems that are regularizations of the original problem. After given an appropriate criterion for approximate solutions of subproblems by adopting a merit function, the proximal point al...

Journal: :journal of linear and topological algebra (jlta) 0
r messaoud university of gafsa tunisia i basdouri university of gafsa tunisia. a missaoui university of gafsa tunisia

a. csaszar introduced and extensively studied the notion of generalized opensets. following csazar, we introduce a new notion hyperconnected. we study some speci cproperties about connected and hyperconnected in generalized topological spaces. finally, wecharacterize the connected component in generalized topological spaces.

Journal: :Journal of Mathematical Analysis and Applications 1997

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

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