• # TRICE

• Referenced in 46 articles [sw05197]
• solution of a class of minimization problems with nonlinear equality constraints and simple bounds ... second-order necessary KKT conditions. The local rate ... convergence to a nondegenerate strict local minimizer is $q$-quadratic. The results given here include...
• # Pastry

• Referenced in 107 articles [sw11775]
• Pastry takes into account network locality; it seeks to minimize the distance messages travel, according ... node failures, and its good network locality properties...
• # ve08

• Referenced in 148 articles [sw05141]
• separable functions We consider the problem of minimizing a smooth objective function ... only hope to locate a local minimum of f within the usual limitations on storage ... computing time by using a minimization algorithm that exploits some special structure ... clustered eigenvalues at a minimizer x *, in which case conjugate gradient and limited memory variable...
• # GLOPT

• Referenced in 19 articles [sw00359]
• Fortran 77 program for global minimization of a block-separable objective function subject to bound ... point that is near a true local minimizer. Unless there are several local minimizers that...
• # QPOPT

• Referenced in 17 articles [sw07859]
• solution obtained will be a global minimizer. If the quadratic is non-convex ... solution obtained will be a local minimizer or a dead-point. A two-phase active...
• # KELLEY

• Referenced in 631 articles [sw04829]
• optimization methods for unconstrained and bound constrained minimization problems. The style of the book ... first part. Chapter 2 studies the local convergence of Newton’s method, inexact Newton methods ... method is studied in chapter 4. A local convergence analysis is provided and implementation details ... such cases the noise often introduces artificial minimizers. Gradient information, even if available, cannot expected...
• # LERS

• Referenced in 122 articles [sw08637]
• system induces all rules, each in the minimal form, that can be induced from ... user has a choice between the local or global approach...
• # NOA

• Referenced in 14 articles [sw08659]
• package of Fortran subroutines for minimizing a locally Lipschitz continuous function subject to locally Lipschitzian...
• # Algorithm 829

• Referenced in 58 articles [sw04467]
• parameters: (i) problem dimension, (ii) number of local minima, (iii) value of the global minimum ... attraction region of the global minimizer, (v) distance from the global minimizer to the vertex ... function including locations and values of all local minima is supplied to the user. Partial...
• # Walksat

• Referenced in 209 articles [sw04328]
• GSAT and WalkSat are local search algorithms to solve Boolean satisfiability problems. Both algorithms work ... flip. GSAT makes the change which minimizes the number of unsatisfied clauses...
• # SNLSDP

• Referenced in 38 articles [sw05127]
• approach with regularization for solving sensor network localization problems. The algorithm first solves ... relaxation (with regularization) of the non-convex minimization problem (1), and use the SDP computed ... designed for solving small size senor network localization problems with up to 200 sensors...
• # CALMA

• Referenced in 106 articles [sw03235]
• number of frequencies used is to be minimized. Problems of this type were investigated within ... approximation techniques including a variety of local search methods, genetic algorithms, neural networks, and potential...
• # simannf90

• Referenced in 119 articles [sw05059]
• Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm From authors’ summary ... criterion, thus tending to avoid the first local minima encountered. The new method proved...