Analytically exact spiral scheme for generating uniformly distributed points on the unit sphere

The problem of constructing a set of uniformly-distributed points on the surface of a sphere, also known as the Thomson problem, has a long and interesting history, which dates back to J.J. Thomson in 1904. A particular variant of the Thomson problem that is of great importance to biomedical imaging is that of generating a nearly uniform distribution of points on the sphere via a deterministic scheme. Although the point set generated through the minimization of electrostatic potential is the gold standard, minimizing the electrostatic potential of one thousand points (or charges) or more remains a formidable task. Therefore, a deterministic scheme capable of generating efficiently and accurately a set of uniformly-distributed points on the sphere has an important role to play in many scientific and engineering applications, not the least of which is to serve as an initial solution (with random perturbation) for the electrostatic repulsion scheme. In the work, we will present an analytically exact spiral scheme for generating a highly uniform distribution of points on the unit sphere.     

Randomized methods based on new Monte Carlo schemes for control and optimization

We address randomized methods for control and optimization based on generating points uniformly distributed in a set. For control systems this sets are either stability domain in the space of feedback controllers, or quadratic stability domain, or robust stability domain, or level set for a performance specification. By generating random points in the prescribed set one can optimize some additional performance index. To implement such approach we exploit two modern Monte Carlo schemes for generating points which are approximately uniformly distributed in a given convex set. Both methods use boundary oracle to find an intersection of a ray and the set. The first method is Hit-and-Run, the second is sometimes called Shake-and-Bake. We estimate the rate of convergence for such methods and demonstrate the link with the center of gravity method. Numerical simulation results look very promising.     

Strong convergence theorems for infinite family of relatively quasi nonexpansive mappings and systems of equilibrium problems

In this paper, we construct a new iterative scheme by hybrid method for approximation of common element of set of common fixed points of countably infinite family of relatively quasi-nonexpansive mappings and set of common solutions to a system of equilibrium problems in a uniformly convex and uniformly smooth real Banach space using the properties of generalized f-projection operator. Then, we prove strong convergence of the scheme to a common element of the two sets. Furthermore, we apply our results to solve convex minimization problem. Our results extend important recent results.     

Isotropic umbrella based triangulation of regular parametric surfaces

In this paper we propose an advancing front method for generating an isotropic triangular mesh on a regular parametric surface. Starting from a point on the surface, the method computes a set of points in the intersection curve between the surface and the sphere centered at that point with a prescribed radius. From this set we select the vertices of a cell composed by triangles approximately equilateral. The mesh grows repeating the described computation with boundary vertices of the cell as starting points. Compared to methods proposed by other authors, the current method may be considered as an improvement, since it is more efficient and flexible. Furthermore, the resulting mesh is closer to being isotropic. Additionally, we obtain a sufficient condition ensuring that a surface triangulation is of Delaunay type.     

Point Sets on the Sphere \mathbb{S}^{2} with Small Spherical Cap Discrepancy

In this paper we study the geometric discrepancy of explicit constructions of uniformly distributed points on the two-dimensional unit sphere. We show that the spherical cap discrepancy of random point sets, of spherical digital nets and of spherical Fibonacci lattices converges with order?N ^?1/2. Such point sets are therefore useful for numerical integration and other computational simulations. The proof uses an area-preserving Lambert map. A?detailed analysis of the level curves and sets of the pre-images of spherical caps under this map is given.     

Strong convergence theorems for nonexpansive mappings and inverse-strongly monotone mappings

In this paper, we introduce an iterative scheme for finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of the variational inequality for an inverse-strongly monotone mapping in a Hilbert space. Then we show that the sequence converges strongly to a common element of two sets. Using this result, we consider the problem of finding a common fixed point of a nonexpansive mapping and a strictly pseudocontractive mapping and the problem of finding a common element of the set of fixed points of a nonexpansive mapping and the set of zeros of an inverse-strongly monotone mapping.     

A generalized f-projection method for countable families of weak relatively nonexpansive mappings and the system of generalized Ky Fan inequalities

The purpose of this paper is to present new hybrid Ishikawa iteration process by the generalized f-projection operator for finding a common element of the fixed point set for two countable families of weak relatively nonexpansive mappings and the set of solutions of the system of generalized Ky Fan inequalities in a uniformly convex and uniformly smooth Banach space. Furthermore, we show that our new iterative scheme converges strongly to a common element of the afore mentioned sets. As applications, we apply our results to obtain some new results for finding a solution of a common fixed point of two countable in finite families, a system of generalized Ky Fan inequalities and a common zero-point problem for general B-monotone and maximal monotone operators in Banach spaces. The results presented in this paper improve and extend important recent results.     

非扩张映射的不动点与变分包含问题的公共解

In this paper, we introduce an iterative scheme for finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of the variational inclusion for an inverse-strongly monotone mapping and a maximal monotone mapping in a real Hilbert space. Then we show that the sequence converges strongly to a common element of two sets. Using the result, we consider the problem of finding a common fixed point of a nonexpansive mapping and a strictly pseudocontractive mapping in a real Hilbert space.     

Strong convergence theorems by hybrid methods for a finite family of nonexpansive mappings and inverse-strongly monotone mappings

In this paper, we introduce and study an iterative scheme by a hybrid method for finding a common element of the set of solutions of an equilibrium problem, the set of common fixed points of a finite family of nonexpansive mappings and the set of solutions of the variational inequality for an inverse-strongly-monotone mapping in a real Hilbert space. Then, we prove that the iterative sequence converges strongly to a common element of the three sets. Using this result, we consider the problem of finding a common fixed point of a finite family of nonexpansive mappings and a strictly pseudocontractive mapping and the problem of finding a common element of the set of common fixed points of a finite family of nonexpansive mappings and the set of zeros of an inverse-strongly monotone mapping. The results obtained in this paper extend and improve the several recent results in this area.     

Fixed point solutions of generalized equilibrium problems for nonexpansive mappings

In this paper, we introduce an iterative scheme for finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of a generalized equilibrium problem in a real Hilbert space. Then, strong convergence of the scheme to a common element of the two sets is proved. As an application, problem of finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of an equilibrium problem is solved. Moreover, solution is given to the problem of finding a common element of fixed points set of nonexpansive mappings and the set of solutions of a variational inequality problem.     

On a generalization of distance sets

A subset X in the d-dimensional Euclidean space is called a k-distance set if there are exactly k distinct distances between two distinct points in X and a subset X is called a locally k-distance set if for any point x in X, there are at most k distinct distances between x and other points in X.Delsarte, Goethals, and Seidel gave the Fisher type upper bound for the cardinalities of k-distance sets on a sphere in 1977. In the same way, we are able to give the same bound for locally k-distance sets on a sphere. In the first part of this paper, we prove that if X is a locally k-distance set attaining the Fisher type upper bound, then determining a weight function w, (X,w) is a tight weighted spherical 2k-design. This result implies that locally k-distance sets attaining the Fisher type upper bound are k-distance sets. In the second part, we give a new absolute bound for the cardinalities of k-distance sets on a sphere. This upper bound is useful for k-distance sets for which the linear programming bound is not applicable. In the third part, we discuss about locally two-distance sets in Euclidean spaces. We give an upper bound for the cardinalities of locally two-distance sets in Euclidean spaces. Moreover, we prove that the existence of a spherical two-distance set in (d−1)-space which attains the Fisher type upper bound is equivalent to the existence of a locally two-distance set but not a two-distance set in d-space with more than d(d+1)/2 points. We also classify optimal (largest possible) locally two-distance sets for dimensions less than eight. In addition, we determine the maximum cardinalities of locally two-distance sets on a sphere for dimensions less than forty.     

Implementing pure adaptive search for global optimization using Markov chain sampling

The Pure Adaptive Search (PAS) algorithm for global optimization yields a sequence of points, each of which is uniformly distributed in the level set corresponding to its predecessor. This algorithm has the highly desirable property of solving a large class of global optimization problems using a number of iterations that increases at most linearly in the dimension of the problem. Unfortunately, PAS has remained of mostly theoretical interest due to the difficulty of generating, in each iteration, a point uniformly distributed in the improving feasible region. In this article, we derive a coupling equivalence between generating an approximately uniformly distributed point using Markov chain sampling, and generating an exactly uniformly distributed point with a certain probability. This result is used to characterize the complexity of a PAS-implementation as a function of (a) the number of iterations required by PAS to achieve a certain solution quality guarantee, and (b) the complexity of the sampling algorithm used. As an application, we use this equivalence to show that PAS, using the so-called Random ball walk Markov chain sampling method for generating nearly uniform points in a convex region, can be used to solve most convex programming problems in polynomial time.     

A general iterative scheme for nonexpansive mappings and inverse-strongly monotone mappings

In this paper, we introduce an general iterative scheme for finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of the variational inequality for an inverse-strongly monotone mapping in a Hilbert space. We show that the iterative sequence converges strongly to a common element of the two sets. Using this results, we consider the problem of finding a common fixed point of a nonexpansive mapping and a strictly pseudocontractive mapping and the problem of finding a common element of the set of fixed points of a nonexpansive mapping and the set of zeros of an inverse-strongly monotone mapping. The results of this paper extended and improved the results of Iiduka and Takahashi (Nonlinear Anal. 61:341–350, 2005).     

Partial surface matching by using directed footprints

In this paper we present a new technique for partial surface and volume matching of images in three dimensions. In this problem, we are given two objects in 3-space, each represented as a set of points, scattered uniformly along its boundary or inside its volume. The goal is to find a rigid motion of one object which makes a sufficiently large portion of its boundary lying sufficiently close to a corresponding portion of the boundary of the second object. This is an important problem in pattern recognition and in computer vision, with many industrial, medical, and chemical applications. Our algorithm is based on assigning a directed footprint to every point of the two sets, and locating all the pairs of points (one of each set) whose undirected components of the footprints are sufficiently similar. The algorithm then computes for each such pair of points all the rigid transformations that map the first point to the second, while making the respective direction components of their footprints coincide. A voting scheme is employed for computing transformations which map significantly large number of points of the first set to points of the second set. Experimental results on various examples are presented and show the accurate and robust performance of our algorithm.     

Hybrid algorithm for fixed points of weak relatively nonexpansive mappings and applications

In this paper, we introduce an iterative scheme for finding a common element of the set of fixed points of a weak relatively nonexpansive mapping, the set of solutions of the variational inequality for the monotone mapping and the set of solutions of an equilibrium problem in a 2-uniformly convex and uniformly smooth Banach space. Then we show that the iterative sequence converges strongly to a common element of the three sets. In this paper, we also give an example which is a weak relatively nonexpansive mapping but not a relatively nonexpansive mapping in Banach space $l^2$.     

Iterative approximation method for finite family of relatively quasi nonexpansive mappings and systems of equilibrium problems

In this paper, a new iterative scheme by hybrid method is constructed. Strong convergence of the scheme to a common element of the set of common fixed points of a finite family of relatively quasi-nonexpansive mappings and set of common solutions to a system of equilibrium problems in a uniformly convex real Banach space which is also uniformly smooth is proved. Our results extend important recent results.     

Limiting points of stochastic flows

It is known that if the flow of a stochastic differential equation on a compact manifold has only negative Lyapunov exponents, then its limiting behavior can be described by a moving random set σof n points. We study the properties of σ and the associated domains of attraction. For example, we will show that it is supported by a compact set on which the induced flow has only one limiting point. On a d-dimensional sphere, if the support of the stochastic flow contains all the isometries, then n=1 or 2, and in the latter case, the two random points and their domains of attractions are antipodal symmetric     

Strongly extreme points in Banach spaces

In this paper some properties of a special type of boundary point of convex sets in Banach spaces are studied. Specifically, a strongly extreme point x of a convex set S is a point of S such that for each real number r>0, segments of length 2r and centered x are not uniformly closer to S than some positive number d(x,r). Results are obtained comparing the notion of strongly extreme point to other known types of special boundary points of convex sets. Using the notion of strongly extreme point, a convexity condition is defined on the norm of the space under consideration, and this convexity condition makes possible a unified treatment of some previously studied convexity conditions. In addition, a sufficient condition is given on the norm of a separable conjugate space for every extreme point of the unit ball to be strongly extreme.     

Finding a representative nondominated set for multi-objective mixed integer programs

In this paper, we develop algorithms to find small representative sets of nondominated points that are well spread over the nondominated frontiers for multi-objective mixed integer programs. We evaluate the quality of representations of the sets by a Tchebycheff distance-based coverage gap measure. The first algorithm aims to substantially improve the computational efficiency of an existing algorithm that is designed to continue generating new points until the decision maker (DM) finds the generated set satisfactory. The algorithm improves the coverage gap value in each iteration by including the worst represented point into the set. The second algorithm, on the other hand, guarantees to achieve a desired coverage gap value imposed by the DM at the outset. In generating a new point, the algorithm constructs territories around the previously generated points that are inadmissible for the new point based on the desired coverage gap value. The third algorithm brings a holistic approach considering the solution space and the number of representative points that will be generated together. The algorithm first approximates the nondominated set by a hypersurface and uses it to plan the locations of the representative points. We conduct computational experiments on randomly generated instances of multi-objective knapsack, assignment, and mixed integer knapsack problems and show that the algorithms work well.     

Iterative approximation of zeroes of monotone operators and system of generalized mixed equilibrium problems

In this paper, we construct a new iterative scheme by hybrid method for approximation of common element of set of zeroes of a finite family of ??-inverse-strongly monotone operators and set of common solutions to a system of generalized mixed equilibrium problems in a 2-uniformly convex real Banach space which is also uniformly smooth. Then, we prove strong convergence of the scheme to a common element of the two sets.