A Generalized Strong Convergence Algorithm in the Presence of Errors for Variational Inequality Problems in Hilbert Spaces

In this paper, we study the strong convergence of an algorithm to solve the variational inequality problem which extends a recent paper (Thong et al., Numerical Algorithms. 78, 1045-1060 (2018)). We reduce and refine some of their algorithm conditions and we prove the convergence of the algorithm in the presence of some computational errors. Then, using the MATLAB software, the result will be illustrated with some numerical examples. Also, we compare our algorithm with some other well-known algorithms.

Normal form for lower dimensional elliptic tori in Hamiltonian systems

<abstract><p>We give a proof of the convergence of an algorithm for the construction of lower dimensional elliptic tori in nearly integrable Hamiltonian systems. The existence of such invariant tori is proved by leading the Hamiltonian to a suitable normal form. In particular, we adapt the procedure described in a previous work by Giorgilli and co-workers, where the construction was made so as to be used in the context of the planetary problem. We extend the proof of the convergence to the cases in which the two sets of frequencies, describing the motion along the torus and the transverse oscillations, have the same order of magnitude.</p></abstract>

Three-Dimensional Genetic Algorithm for the Kirkman's Schoolgirl Problem

This paper focuses on the possibilities of multidimensional genetic algorithms and relevant genetic operators. After the literature overview we used a three-dimensional genetic algorithm to solve a combinatorial task called Kirkman’s Schoolgirl Problem. The first results were not good, but we improved convergence of an algorithm by adding more genetic operators. We also used problem dependent mutation, where we tried to repair the incorrect solution by using the simple heuristic method. Finally, we got a solid number of correct solutions, but we know there is enough room for other improvements.