Strong convergence theorems for countable families of asymptotically relatively nonexpansive mappings with applications

The purpose of this paper is by using the hybrid iterative method to prove some strong convergence theorems for approximating a common element of the set of solutions to a system of generalized mixed equilibrium problems and the set of common fixed points for two countable families of closed and asymptotically relatively nonexpansive mappings in Banach space. The results presented in the paper improve and extend the corresponding results of Su et al. [Y.F. Su, H.K. Xu, X. Zhang, Strong convergence theorems for two countable families of weak relatively nonexpansive mappings and applications, Nonlinear Anal. 73 (2010) 3890-3906], Li and Su [H.Y. Li, Y.F. Su, Strong convergence theorems by a new hybrid for equilibrium problems and variational inequality problems, Nonlinear Anal. 72 (2) (2010) 847-855], Chang et al. [S.S. Chang, H.W. Joseph Lee, Chi Kin Chan, A new hybrid method for solving a generalized equilibrium problem solving a variational inequality problem and obtaining common fixed points in Banach spaces with applications, Nonlinear Anal. TMA 73 (2010) 2260-2270], Kang et al. [J. Kang, Y. Su, X. Zhang, Hybrid algorithm for fixed points of weak relatively nonexpansive mappings and applications, Nonlinear Anal. HS 4 (4) (2010) 755-765], Matsushita and Takahashi [S. Matsushita, W. Takahashi, A strong convergence theorem for relatively nonexpansive mappings in Banach spaces, J. Approx. Theory 134 (2005) 257-266], Tan et al. [J.F. Tan, S.S. Chang, M. Liu, J.I. Liu, Strong convergence theorems of a hybrid projection algorithm for a family of quasi-?-asymptotically nonexpansive mappings, Opuscula Math. 30 (3) (2010) 341-348], Takahashia and Zembayashi [W. Takahashi, K. Zembayashi, Strong and weak convergence theorems for equilibrium problems and relatively nonexpansive mappings in Banach spaces, Nonlinear Anal. 70 (2009) 45-57] and Wattanawitoon and Kumam [K. Wattanawitoon, P. Kumam, Strong convergence theorems by a new hybrid projection algorithm for fixed point problem and equilibrium problems of two relatively quasi-nonexpansive mappings, Nonlinear Anal. Hybrid Systems 3 (2009) 11-20] and others.     

Convergence theorems for mixed equilibrium problems, variational inequality problem and uniformly quasi-?-asymptotically nonexpansive mappings

We introduce a modified block hybrid projection algorithm for finding a common element of the set of common fixed points of an infinite family of closed and uniformly quasi-?-asymptotically nonexpansive mappings, the set of the variational inequality for an α-inverse-strongly monotone operator, the set of solutions of the mixed equilibrium problems. Then, we obtain strong convergence theorems for the sequences generated by this process in a 2-uniformly convex and uniformly smooth Banach space. Our results extend and improve ones from several earlier works.     

Study on connections of the MFS, Trefftz method, indirect BIEM and invariant MFS in the three-dimensional Laplace problems containing spherical boundaries

Following the success of a study on the method of fundamental solutions using an image concept [13], we extend to solve the three-dimensional Laplace problems containing spherical boundaries by using the three approaches. The case of eccentric sphere for the Laplace problem is considered. The optimal locations for the source distribution to include the foci in the MFS are also examined by using the image concept in the 3D problems. Whether a free constant is required or not in the MFS is also studied. The error distribution is discussed after comparing with the analytical solution derived by using the bispherical coordinates. Besides, the relationship between the Trefftz bases and the singularity in the MFS for the three-dimensional Laplace problems is also addressed. It is found that one source of the MFS contains several interior and exterior Trefftz sets through a degenerate kernel. On the contrary, one single Trefftz base can be superimposed by some lumped sources in the MFS through an indirect BIEM. Based on this finding, the relationship between the fictitious boundary densities of the indirect BIEM and the singularity strength in the MFS can be constructed due to the fact that the MFS is a lumped version of an indirect BIEM.     

Hausdorff moment problem and fractional moments: A simplified procedure

The purpose of this paper is the recovering of a probability density function with support [0, 1] from the knowledge of its sequence of moments, i.e. the classical Hausdorff moment problem. To avoid the well-known ill-conditioning, firstly the moment curve is calculated from the assigned sequence of moments; next the unknown density is approximated by Maximum Entropy (MaxEnt) technique selecting some proper points on the moment curve. Exploiting convergence in entropy, a simplified quick procedure is suggested to recover the approximate density. An application to Laplace Transform inversion is illustrated.     

POSITIVE SOLUTIONS TO m-POINT BOUNDARY VALUE PROBLEM OF NONLINEAR FRACTIONAL DIFFERENTIAL EQUATION WITH p-LAPLACIAN

In this paper,we are concerned with the existence of positive solutions to an m-point boundary value problem with p-Laplacian of nonlinear fractional differential equation.By means of Krasnosel'skii fixed-point theorem on a convex cone and Leggett-Williams fixed-point theorem,the existence results of solutions are obtained.     

A comparison of lower bounds for the symmetric circulant traveling salesman problem

When the matrix of distances between cities is symmetric and circulant, the traveling salesman problem (TSP) reduces to the so-called symmetric circulant traveling salesman problem (SCTSP), that has applications in the design of reconfigurable networks, and in minimizing wallpaper waste. The complexity of the SCTSP is open, but conjectured to be NP-hard, and we compare different lower bounds on the optimal value that may be computed in polynomial time. We derive a new linear programming (LP) relaxation of the SCTSP from the semidefinite programming (SDP) relaxation in [E. de Klerk, D.V. Pasechnik, R. Sotirov, On semidefinite programming relaxation of the traveling salesman problem, SIAM Journal of Optimization 19 (4) (2008) 1559-1573]. Further, we discuss theoretical and empirical comparisons between this new bound and three well-known bounds from the literature, namely the Held-Karp bound [M. Held, R.M. Karp, The traveling salesman problem and minimum spanning trees, Operations Research 18 (1970) 1138-1162], the 1-tree bound, and the closed-form bound for SCTSP proposed in [J.A.A. van der Veen, Solvable cases of TSP with various objective functions, Ph.D. Thesis, Groningen University, The Netherlands, 1992].     

Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling

We extend the classical linear assignment problem to the case where the cost of assigning agent j to task i is a multiplication of task i’s cost parameter by a cost function of agent j. The cost function of agent j is a linear function of the amount of resource allocated to the agent. A solution for our assignment problem is defined by the assignment of agents to tasks and by a resource allocation to each agent. The quality of a solution is measured by two criteria. The first criterion is the total assignment cost and the second is the total weighted resource consumption. We address these criteria via four different problem variations. We prove that our assignment problem is NP-hard for three of the four variations, even if all the resource consumption weights are equal. However, and somewhat surprisingly, we find that the fourth variation is solvable in polynomial time. In addition, we find that our assignment problem is equivalent to a large set of important scheduling problems whose complexity has been an open question until now, for three of the four variations.     

Permuting operations on strings and their relation to prime numbers

Some length-preserving operations on strings only permute the symbol positions in strings; such an operation X gives rise to a family {X_n}_n≥2 of similar permutations. We investigate the structure and the order of the cyclic group generated by X_n. We call an integer n X-prime if X_n consists of a single cycle of length n (n≥2). Then we show some properties of these X-primes, particularly, how X-primes are related to X^′-primes as well as to ordinary prime numbers. Here X and X^′ range over well-known examples (reversal, cyclic shift, shuffle, twist) and some new ones based on the Archimedes spiral and on the Josephus problem.     

A tight colored Tverberg theorem for maps to manifolds

We prove that any continuous map of an N-dimensional simplex ΔN with colored vertices to a d-dimensional manifold M must map r points from disjoint rainbow faces of ΔN to the same point in M: For this we have to assume that N?(r−1)(d+1), no r vertices of ΔN get the same color, and our proof needs that r is a prime. A face of ΔN is a rainbow face if all vertices have different colors.This result is an extension of our recent “new colored Tverberg theorem”, the special case of M=Rd. It is also a generalization of Volovikov?s 1996 topological Tverberg theorem for maps to manifolds, which arises when all color classes have size 1 (i.e., without color constraints); for this special case Volovikov?s proof, as well as ours, works when r is a prime power.     

Existence of optimal solutions for general stochastic linear complementarity problems

In this paper we show the solvability of the expected residual minimization (ERM) formulation for the general stochastic linear complementarity problem (SLCP) under mild assumptions. The properties of the ERM formulation are dependent on the choice of NCP functions. We focus on the ERM formulations defined by the “min” NCP function and the penalized FB function, both of which are nonconvex programs on the nonnegative orthant.