Geometric optimisation and approximation algorithms form a vibrant research area that intersects computational geometry, combinatorial optimisation and algorithm design. Researchers are dedicated to ...
The stochastic root-finding problem is that of finding a zero of a vector-valued function known only through a stochastic simulation. The simulation-optimization problem is that of locating a ...
This is a preview. Log in through your library . Abstract In this paper we discuss the application of Lawson's algorithm for computing best linear Chebyshev approximations to complex-valued functions.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback