We study the one-dimensional root finding problem for increasing convex functions. We give gradient-free algorithms for both exact and inexact (stochastic) function evaluations. ...
Through analysis of present pseudo-parallel genetic algorithm, propose a new dynamic sub-population pseudo-parallel genetic algorithm. It changes the condition that the magnitude o...
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...
Convergence of blind delayed source separation algorithms, which use constant learning rates, is known to be slow. We propose a fuzzy logic based approach to adaptively select the...
A low complexity user scheduling algorithm based on a novel adaptive Markov chain Monte Carlo (AMCMC) method is proposed to achieve the maximal sum capacity in an uplink multiple-i...
Yangyang Zhang, Chunlin Ji, Yi Liu, Wasim Q. Malik...