• Journal of applied mathematics & informatics
• /
• 제27권3_4호
• /
• pp.661-672
• /
• 2009

In this paper, we introduce a modified three-step iteration scheme with errors for asymptotically nonexpansive mappings in the framework of uniformly convex Banach spaces. Weak and strong convergence theorems are established.

• 대한수학회지
• /
• 제31권3호
• /
• pp.333-337
• /
• 1994

Many authors[3][4][5] constructed and examined some processes for the fixed point of strictly pseudocontractive mapping in various Banach spaces. In fact the fixed point of strictly pseudocontractive mapping is the zero of strongly accretive operators. So the same processes are used for the both circumstances. Reich[3] proved that Mann-iteration precess can be applied to approximate the zero of strongly accretive operator in uniformly smooth Banach spaces. In the above paper he asked whether the fact can be extended to other Banach spaces the duals of which are not necessarily uniformly convex. Recently Schu[4] proved it for uniformly continuous strictly pseudocontractive mappings in smooth Banach spaces. In this paper we proved that Mann-iteration process can be applied to approximate the fixed point of strictly pseudocontractive mapping in certain Banach spaces.

• 대한수학회논문집
• /
• 제38권4호
• /
• pp.1111-1126
• /
• 2023

In this paper, we define a new subclass of k-uniformly starlike functions of order γ (0 ≤ γ < 1) by using certain generalized q-integral operator. We explore geometric interpretation of the functions in this class by connecting it with conic domains. We also investigate q-sufficient coefficient condition, q-Fekete-Szegö inequalities, q-Bieberbach-De Branges type coefficient estimates and radius problem for functions in this class. We conclude this paper by introducing an analogous subclass of k-uniformly convex functions of order γ by using the generalized q-integral operator. We omit the results for this new class because they can be directly translated from the corresponding results of our main class.

• Korean Journal of Mathematics
• /
• 제19권3호
• /
• pp.279-289
• /
• 2011

Let E be a uniformly convex Banach space with a uniformly Gateaux differentiable norm, C be a nonempty closed convex subset of E and f : $C{\rightarrow}C$ be a fixed bounded continuous strong pseudocontraction with the coefficient ${\alpha}{\in}(0,1)$. Let $\{{\lambda}_t\}_{0<t<1}$ be a net of positive real numbers such that ${\lim}_{t{\rightarrow}0}{\lambda}_t={\infty}$ and S = {$T(s)$ : $0{\leq}s$ < ${\infty}$} be a nonexpansive semigroup on C such that $F(S){\neq}{\emptyset}$, where F(S) denotes the set of fixed points of the semigroup. Then sequence {$x_t$} defined by $x_t=tf(x_t)+(1-t)\frac{1}{{\lambda}_t}{\int_{0}}^{{\lambda}_t}T(s)x{_t}ds$ converges strongly as $t{\rightarrow}0$ to $\bar{x}{\in}F(S)$, which solves the following variational inequality ${\langle}(f-I)\bar{x},\;p-\bar{x}{\rangle}{\leq}0$ for all $p{\in}F(S)$.

• East Asian mathematical journal
• /
• 제25권2호
• /
• pp.179-196
• /
• 2009

Let E be a uniformly convex Banach space and K a nonempty closed convex subset which is also a nonexpansive retract of E. For i = 1, 2, 3, let $T_i:K{\rightarrow}E$ be an asymptotically nonexpansive mappings with sequence ${\{k_n^{(i)}\}\subset[1,{\infty})$ such that $\sum_{n-1}^{\infty}(k_n^{(i)}-1)$ < ${\infty},\;k_{n}^{(i)}{\rightarrow}1$, as $n{\rightarrow}\infty$ and F(T)=$\bigcap_{i=3}^3F(T_i){\neq}{\phi}$ (the set of all common xed points of $T_i$, i = 1, 2, 3). Let {$a_n$},{$b_n$} and {$c_n$} are three real sequences in [0, 1] such that $\in{\leq}\;a_n,\;b_n,\;c_n\;{\leq}\;1-\in$ for $n{\in}N$ and some ${\in}{\geq}0$. Starting with arbitrary $x_1{\in}K$, define sequence {$x_n$} by setting {$$x_{n+1}=P((1-a_n)x_n+a_nT_1(PT_1)^{n-1}y_n)$$ $$y_n=P((1-b_n)x_n+a_nT_2(PT_2)^{n-1}z_n)$$ $$z_n=P((1-c_n)x_n+c_nT_3(PT_3)^{n-1}x_n)$$. Assume that one of the following conditions holds: (1) E satises the Opial property, (2) E has Frechet dierentiable norm, (3) $E^*$ has Kedec -Klee property, where $E^*$ is dual of E. Then sequence {$x_n$} converges weakly to some p${\in}$F(T).

• Journal of applied mathematics & informatics
• /
• 제35권3_4호
• /
• pp.313-321
• /
• 2017

In this note we establish a new non-convex hybrid iteration algorithm corresponding to Khan iterative process [4] and prove strong convergence theorems of common fixed points for a uniformly closed asymptotically family of countable quasi-Lipschitz mappings in Hilbert spaces. Moreover, the main results are applied to get the common fixed points of finite family of quasi-asymptotically nonexpansive mappings. The results presented in this article are interesting extensions of some current results.

• Kyungpook Mathematical Journal
• /
• 제55권2호
• /
• pp.395-410
• /
• 2015

For functions $f(z)=z+a_2z^2+a_3z^3+{\cdots}$ with ${\mid}a_2{\mid}=2b$, $b{\geq}0$, sharp radii of starlikeness of order ${\alpha}(0{\leq}{\alpha}<1)$, convexity of order ${\alpha}(0{\leq}{\alpha}<1)$, parabolic starlikeness and uniform convexity are derived when ${\mid}a_n{\mid}{\leq}M/n^2$ or ${\mid}a_n{\mid}{\leq}Mn^2$ (M>0). Radii constants in other instances are also obtained.

• 한국정밀공학회지
• /
• 제21권9호
• /
• pp.149-157
• /
• 2004

This paper presents a new method for hi-objective optimization. Ordinary weighted sum method is easy to implement, but it has two significant drawbacks: (1) the solution distribution by the weighted sum method is not uniform, and (2) the method cannot determine any solutions that reside in non-convex regions of a Pareto front. The proposed adaptive weighted sum method does not solve a multiobjective optimization in a predetermined way, but it focuses on the regions that need more refinement by imposing additional inequality constraints. It is demonstrated that the adaptive weighted sum method produces uniformly distributed solutions and finds solutions on non-convex regions. Two numerical examples and a simple structural problem are presented to verify the performance of the proposed method.

• Communications for Statistical Applications and Methods
• /
• 제31권4호
• /
• pp.393-408
• /
• 2024

The sparse linear discriminant analysis can be incorporated into the penalized linear regression framework, but most studies have been limited to specific convex penalties, including the least absolute selection and shrinkage operator and its variants. Within this framework, concave penalties can serve as natural counterparts of the convex penalties. Implementing the concave penalized direction vector of discrimination appears to be straightforward, but developing its theoretical properties remains challenging. In this paper, we explore a class of concave penalties that covers the smoothly clipped absolute deviation and minimax concave penalties as examples. We prove that employing concave penalties guarantees an oracle property uniformly within this penalty class, even for high-dimensional samples. Here, the oracle property implies that an ideal direction vector of discrimination can be exactly recovered through concave penalized least squares estimation. Numerical studies confirm that the theoretical results hold with finite samples.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제15권4호
• /
• pp.305-314
• /
• 2015

The work presented in this paper deals with a navigation problem for multiple mobile robot system in unknown indoor environments. The environment is completely unknown for all the robots and the surrounding information should be detected by the proximity sensors installed on the robots' bodies. In order to guide all the robots to move along collision-free paths and reach the goal positions, a navigation method based on the combination of a set of primary strategies has been developed. The indoor environments usually contain convex and concave obstacles. In this work, a danger judgment strategy in accordance with the sensors' data is used for avoiding small convex obstacles or moving objects which include both dynamic obstacles and other robots. For big convex obstacles or concave ones, a wall following strategy is designed for dealing with these special situations. In this paper, a state memorizing strategy is also proposed for the "infinite repetition" or "dead cycle" situations. Finally, when there is no collision risk, the robots will be guided towards the targets according to a target positioning strategy. Most of these strategies are achieved by the means of fuzzy logic controllers and uniformly applied for every robot. The simulation experiments verified that the proposed method has a positive effectiveness for the navigation problem.