In this paper we present a Population-Based Iterated Greedy (PBIG) algorithm for delimiting and zoning rural settlements. Each cadastral plots is allocated to a category (traditional–historical, common or none) considering ...

We propose a method for accelerating iterative algorithms for solving symmetric linear complementarity problems. The method consists in performing a one-dimensional optimization in the direction generated by a splitting ...

We propose a method for accelerating iterative algorithms for solving symmetric linear complementarity problems. The method consists in performing a one-dimensional optimization in the direction generated by a splitting ...

Discriminative training of Gaussian Mixture Models (GMMs) for speech or speaker recognition purposes is usually based on the gradient descent method, in which the iteration step-size, ε, uses to be defined experimentally. ...

Recently, specially crafted unidimensional optimization has been successfully used as line search to accelerate the overrelaxed and monotone fast iterative shrinkage-threshold algorithm (OMFISTA) for computed tomography. ...

Aczél’s and Ryll-Nardzewski’s dyadic iterations are iterative procedures which associate to a given mean M a family of means { Md: d∈ Dyad ([ 0 , 1 ]) } parameterized by Dyad ([ 0 , 1 ]) , the dyadic fractions of the ...

We study the maximum likelihood model in emission tomography and propose a new family of algorithms for its solution, called string-averaging expectation maximization (SAEM). In the string-averaging algorithmic regime, the ...