• PaGMO/PyGMO

  • Referenced in 11 articles [sw05070]
  • PaGMO/PyGMO. Parallel Global Multiobjective Optimizer (and its Python alter ego PyGMO) offers a user-friendly ... wide array of global and local optimization algorithms and problems. The main purpose ... software is to provide a parallelization engine common to all algorithms through the ’generalized island...
  • PANMIN

  • Referenced in 4 articles [sw04337]
  • PANMIN: sequential and parallel global optimization procedures with a variety of options for the local ... present two sequential and one parallel global optimization codes, that belong to the stochastic class ... Merlin/MCL environment as a non-interactive local optimizer. This interface proved extremely important, since ... employed by the global procedures. We demonstrate the use of the parallel code...
  • PIKAIA

  • Referenced in 11 articles [sw04744]
  • structure modeling using a parallel genetic algorithm for objective global optimization. Genetic algorithms ... designed a fully parallel and distributed hardware/software implementation of the generalized optimization subroutine PIKAIA, which ... provide an objective determination of the globally optimal parameters for a given model against ... observations of their oscillation frequencies. The efficient, parallel exploration of parameter-space made possible...
  • UEGO

  • Referenced in 17 articles [sw02239]
  • global optimization In this paper, UEGO, a new general technique for accelerating and/or parallelizing existing...
  • p-MEMPSODE

  • Referenced in 1 article [sw18235]
  • MEMPSODE: parallel and irregular memetic global optimization. A parallel memetic global optimization algorithm suitable ... population-based stochastic algorithms, namely Particle Swarm Optimization and Differential Evolution, with two efficient ... inherent and highly irregular parallelism of the memetic global optimization algorithm by means ... tasks correspond to local optimization procedures or simple function evaluations. Parallelization occurs at each iteration...
  • Decogo

  • Referenced in 3 articles [sw32747]
  • algorithms for global optimization. Traditional deterministic global optimization methods are often based on a branch ... subproblems in parallel (using BB), instead of searching over one (global) BB search tree ... results with Decogo (decomposition-based global optimizer), a new parallel decomposition MINLP solver implemented...
  • SNOBFIT

  • Referenced in 20 articles [sw05289]
  • experiments, performed with the goal of optimizing some user-specified criterion. Since multiple data points ... entered, SNOBFIT can take advantage of parallel function evaluations. The method combines a branching strategy ... enhance the chance of finding a global minimum with a sequential quadratic programming method based ... practical applications, for which most other optimization routines are ill-prepared. Soft constraints are taken...
  • VTDIRECT95

  • Referenced in 11 articles [sw05290]
  • implementation of D. R. Jones’ deterministic global optimization algorithm called DIRECT, which is widely used ... serial code and a data-distributed massively parallel code for different problem scales and optimization...
  • BADMM

  • Referenced in 24 articles [sw20288]
  • ADMM and Bethe ADMM. We establish the global convergence and the O(1/T) iteration complexity ... parallelism and can easily run on GPU. BADMM is several times faster than highly optimized...
  • ARock

  • Referenced in 27 articles [sw16800]
  • abstracts many problems in numerical linear algebra, optimization, and other areas of data science ... asynchronous parallel fashion. Asynchrony is crucial to parallel computing since it reduces synchronization wait, relaxes ... agents share x through either global memory or communication. If writing x i is atomic ... cases of ARock for linear systems, convex optimization, and machine learning, as well as distributed...
  • COCO

  • Referenced in 6 articles [sw13350]
  • global optimisers. COCO provides benchmark function testbeds, experimentation templates which are easy to parallelize ... visualizing data generated by one or several optimizers...
  • COCONUT

  • Referenced in 38 articles [sw04760]
  • converters and the two available global optimization solvers. For more information on obtaining the COCONUT ... COCONUT project) to support parallel computing as wel! l. The solution algorithm is an advanced...
  • SpaceScanner

  • Referenced in 1 article [sw30467]
  • automated management of global stochastic optimization experiments . SpaceScanner uses parallel optimization runs for automatic termination ... consecutively applies a pre-defined set of global stochastic optimization methods in case of stagnation...
  • ARMCI

  • Referenced in 14 articles [sw04639]
  • memory access (RMA) operations (one-sided communication) optimized for contiguous and noncontiguous (strided, scatter/gather ... driven by the need to support the global-addres space communication model in context ... Global Arrays project, EMSL, and recently by the Center for Programming Models for Scalable Parallel...
  • DisreteClimber

  • Referenced in 1 article [sw27611]
  • GLOBAL optimization algorithm. Newly updated with Java implementation and parallelization. In this appendix we list...
  • QNSTOP

  • Referenced in 3 articles [sw26832]
  • parallel decomposition strategies, and the serial driver subroutine can be used for stochastic optimization ... deterministic global optimization, based on an input switch. QNSTOP is particularly effective for “noisy” deterministic...
  • Zippy

  • Referenced in 6 articles [sw34497]
  • cluster programming with a two-level parallelism hierarchy and a non-uniform memory access (NUMA ... passing and shared-memory models. It employs global arrays (GA) to simplify the communication ... exposes data locality to the programmer for optimal performance and scalability. We present three example ... ease the development and integration of parallel visualiza- tion, graphics, and computation modules...
  • Algorithm 744

  • Referenced in 1 article [sw04689]
  • global optimization with constraints A stochastic algorithm is presented for finding the global optimum ... discontinuous and can take advantage of parallel processors. The performance of this algorithm is compared...
  • OVERFLOW-MLP

  • Referenced in 7 articles [sw03008]
  • memory access to global data while invoking two levels of parallelism for scaling efficiency. During ... technique, OVERFLOW-MLP code optimizations, and performance results are presented...
  • TRIOPT

  • Referenced in 6 articles [sw02486]
  • dimensional bound-constrained black box global optimization problems. The method starts by forming a Delaunay ... that hold a promise of containing the global optimum are re-partitioned according to different ... from the available sample set. This changes global information on the best solution and triggers ... black box partitioning approaches proposed for global optimization...