• EGO

  • Referenced in 362 articles [sw07588]
  • Efficient Global Optimization (EGO) algorithm solves costly box-bounded global optimization problems with additional linear...
  • SURROGATES

  • Referenced in 16 articles [sw07575]
  • square error; and others). Surrogate-based optimization: efficient global optimization (EGO) algorithm. Other capabilities: global...
  • PSwarm

  • Referenced in 66 articles [sw00742]
  • global optimization) and the results confirm its competitiveness in terms of efficiency and robustness...
  • lobpcg.m

  • Referenced in 127 articles [sw24008]
  • symmetric eigenvalue problems, based on a local optimization of a three-term recurrence, and suggest ... establish that our algorithm is practically as efficient as the “ideal” algorithm when the same ... those by the much more expensive global optimization method on the same generalized block Krylov...
  • Isomap

  • Referenced in 11 articles [sw31686]
  • nonlinear dimensionality reduction, ours efficiently computes a globally optimal solution, and, for an important class...
  • SparsePOP

  • Referenced in 65 articles [sw04331]
  • method for approximating a global optimal solution of a polynomial optimization problem (POP) proposed ... relaxations of increasing dimensions” Lasserre [2006]. The efficiency of SparsePOP to approximate optimal solutions...
  • DEoptim

  • Referenced in 42 articles [sw08656]
  • differential evolution algorithm for the global optimization of a real-valued function of a real ... DEoptim interfaces with C code for efficiency. The utility of the package is illustrated...
  • SymDIRECT

  • Referenced in 16 articles [sw22239]
  • consider a global optimization problem for a symmetric Lipschitz continuous function. An efficient modification...
  • TINKER

  • Referenced in 10 articles [sw04095]
  • Poisson-Boltzmann calculations, efficient truncated Newton (TNCG) local optimization, surface areas and volumes with derivatives ... methods for global optimization, Monte Carlo Minimization (MCM) for efficient potential surface scanning, and more...
  • bilevel

  • Referenced in 3 articles [sw25305]
  • Efficiently solving linear bilevel programming problems using off-the-shelf optimization software. Many optimization models ... optimal solution of another mathematical program. Due to the lack of optimization software that ... necessary and sufficient optimality conditions. MPCCs are single-level non-convex optimization problems that ... solver to find a local optimal solution. Local optimal information is then used to reduce...
  • Globalizer

  • Referenced in 2 articles [sw27314]
  • processors to solve the global optimization problems efficiently...
  • ZOOpt

  • Referenced in 2 articles [sw22396]
  • derivative-free optimization allow efficient approximating the global optimal solutions of sophisticated functions, such ... article describes the ZOOpt/ZOOjl toolbox that provides efficient derivative-free solvers and are designed easy...
  • RcppDE

  • Referenced in 4 articles [sw10612]
  • RcppDE: Global optimization by differential evolution in C++. This package provides an efficient C++ based ... implementation of the DEoptim function which performs global optimization by differential evolution. Its creation...
  • AlphaECP

  • Referenced in 45 articles [sw04940]
  • applied to general MINLP problems and global optimal solutions can be ensured for pseudo-convex ... problems may be solved to optimality, but can also be solved to feasibility or only ... intermediate iterations. This makes the ECP algorithm efficient and easy to implement. Futher information about...
  • Chebfun2

  • Referenced in 35 articles [sw12708]
  • system that was designed on MATLAB for efficient handling of univariate scalar functions ... this type. For example, the global minimum of a complicated function that can be written ... technology in some relevant issues as global optimization, singular value decomposition, root finding, and vector...
  • SSPMO

  • Referenced in 17 articles [sw07449]
  • problem of approximating the efficient frontier of nonlinear multiobjective optimization problems with continuous variables. Recent ... search have shown its merit as a global optimization technique for single-objective problems. However...
  • 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 ... strategies, forming new partitions. These strategies are efficient in terms of the number ... other efficient black box partitioning approaches proposed for global optimization...
  • SALSA

  • Referenced in 30 articles [sw02661]
  • recognized as an efficient technique for solving hard combinatorial optimization problems. However, it is best ... used in conjunction with other optimization paradigms such as local search, yielding hybrid algorithms with ... language, SALSA, dedicated to specifying (local, global or hybrid) search algorithms. We illustrate...
  • GlobalMIT

  • Referenced in 2 articles [sw38463]
  • task of learning the globally optimal DBN is efficiently achieved in polynomial time. Availability...
  • Boost Interval Arithmetic

  • Referenced in 15 articles [sw13013]
  • library designed to handle mathematical intervals efficiently and in a generic way. Interval computations ... mathematical proofs have relied on global optimization problems solved using branch-and-bound algorithms with...