One of the most important problem for solving the linear system Ax = b, by using the iterative methods, is to use a good stopping criterion and to determine the common significant digits between each corresponding components of computed solution and exact solution. In this paper, for a certain class of iterative methods, we propose a way to determine the number of common significant digits of x...

Recently, initial approximation of Q-values of the multiagent Q-learning by the optimal single-agent Q-values has shown good results in reducing the complexity of the learning process. In this paper, we continue in the same vein and give a brief description of the Initialized Adaptive Play Q-learning (IAPQ) algorithm while establishing an effective stopping criterion for this algorithm. To do t...

The EM algorithm is the standard tool for maximum likelihood estimation in )nite mixture models. The main drawbacks of the EM algorithm are its slow convergence and the dependence of the solution on both the stopping criterion and the initial values used. The problems referring to slow convergence and the choice of a stopping criterion have been dealt with in literature and the present paper de...

Image segmentation plays an important role in many systems of computer vision. The good performance of recognition algorithms depend on the quality of segmented image. According to the opinion of many authors the segmentation concludes when it satisfies the observer’s objectives, the more effective methods being the iterative. However, a problem of these algorithms is the stopping criterion. In...

We previously proposed [1] an iterative word-selective training method to cost-effectively utilize data preparation resources without compromising system performance. We continue this work and investigate the robustness of our active learning approach with respect to the starting conditions and further propose a stopping criterion that supports our objective to make effective use of transcripti...

We consider the solution of nonlinear programs in the case where derivatives of the objective function and nonlinear constraints are unavailable. To solve such problems, we propose an adaptation of a method due to Conn, Gould, Sartenaer, and Toint that proceeds by approximately minimizing a succession of linearly constrained augmented Lagrangians. Our modification is to use a 3 derivative-free ...

We propose a simple stopping criterion for the conjugate gradient (CG) algorithm in the framework of anisotropic, adaptive finite elements for elliptic problems. The goal of the adaptive algorithm is to find a triangulation such that the estimated relative error is close to a given tolerance TOL. We propose to stop the CG algorithm whenever the residual vector has Euclidian norm less than a sma...

We give a pattern search method for nonlinearly constrained optimization that is an adaption of a bound constrained augmented Lagrangian method first proposed by Conn, Gould, and Toint [SIAM J. Numer. Anal., 28 (1991), pp. 545–572]. In the pattern search adaptation, we solve the bound constrained subproblem approximately using a pattern search method. The stopping criterion proposed by Conn, Go...