• # NIMBUS

• Referenced in 63 articles [sw04339]
• into the multiobjective case. The multiple objective functions are treated individually without employing any scalarization ... handling several nonconvex locally Lipschitz continuous objective functions subject to nonlinear (possibly nondifferentiable) constraints. Finally...
• # NOA

• Referenced in 14 articles [sw08659]
• Fortran subroutines for minimizing a locally Lipschitz continuous function subject to locally Lipschitzian inequality...
• # BEDFix

• Referenced in 8 articles [sw04469]
• function of two variables. The function must be Lipschitz continuous with constant 1 with respect ... upper bound on the number of required function evaluations is the same for BEDFix ... than the simple iteration method, when the Lipschitz constant is less than but close ... gradient information; also, it handles functions with minimum Lipschitz constants equal to 1, whereas...
• # SymDIRECT

• Referenced in 8 articles [sw22239]
• DIRECT method for Lipschitz global optimization for a symmetric function. We consider ... global optimization problem for a symmetric Lipschitz continuous function. An efficient modification of the well...
• # SHGO

• Referenced in 1 article [sw26954]
• simplicial homology algorithm for Lipschitz optimisation. The simplicial homology global optimisation (SHGO) algorithm ... homeomorphic to a complex on the objective function. This provides both approximations of locally convex ... function evaluations if the objective function is Lipschitz smooth. In this paper SHGO is applied...
• # Algorithm 848

• Referenced in 2 articles [sw04408]
• function $f$ that has arbitrary dimensionality, is defined on a rectangular domain, and is Lipschitz ... criterion when the Lipschitz constant is less than 1. For functions defined on all rectangular...
• # RPSALG

• Referenced in 5 articles [sw12637]
• problem involving the parametric constraints as objective function with the parameter as variable. In this ... ECAM, a global optimization procedure for solving Lipschitz programming problems. We implement different variants...
• # ranlip

• Referenced in 2 articles [sw00777]
• assumed that the required distribution has Lipschitz-continuous density, which is either given analytically ... upper approximation to the density (the hat function), using a large number of its values...