id: 02068028
dt: a
an: 02068028
au: Beliakov, Gleb; Ting, Kai Ming; Rubinov, Alex
ti: Efficient serial and parallel implementations of the cutting angle method.
so: Di Pillo, Gianni (ed.) et al., High performance algorithms and software for
    nonlinear optimization. Selected lectures presented at the workshop,
    Erice, Italy, June 30‒July 8, 2001. Boston, MA: Kluwer Academic
    Publishers (ISBN 1-4020-7532-4/hbk). Appl. Optim. 82, 57-74 (2003).
py: 2003
pu: Boston, MA: Kluwer Academic Publishers
la: EN
cc: 
ut: parallel computing; global optimization; cutting angle method
ci: 
li: 
ab: Summary: We examine efficient computer implementation of one method of
    deterministic global optimization, the cutting angle method. In this
    method the objective function is approximated from below with piecewise
    linear auxiliary functions. The sequence of global minima of these
    auxiliary functions converges to the global minimum of the objective
    function. Computing the minima of the auxiliary function is a
    combinatorial problem, and we show that it can be effectively
    parallelized. We discuss the improvements made to the serial
    implementation of the cutting angle method, and ways of distributing
    computations across multiple processors on parallel and cluster
    computers.
rv: