• INTOPT_90

  • Referenced in 306 articles [sw04705]
  • many software details. The chapter on global optimization (40 pages) only admits equality constraints (within ... based on branch and bound, infeasibility test, interval Newton algorithm applied to the John conditions ... points generalizing Hansen and Walster’s pioneering concept of 1987 (Nonlinear equations and optimization. Preprint...
  • GQTPAR

  • Referenced in 334 articles [sw07451]
  • algorithm is guaranteed to produce a nearly optimal solution in a finite number of iterations ... Newton’s method has a limit point which satisfies the first and second order necessary ... trust region method. In our tests a call to GQTPAR only required 1.6 iterations...
  • Netgen

  • Referenced in 196 articles [sw06679]
  • generation splits into four subproblems of special point calculation, edge following, surface meshing and finally ... generation rules. Several techniques of mesh optimization are tested and quality plots are presented...
  • SCALCG

  • Referenced in 112 articles [sw08453]
  • using the function values in two successive points. In very mild conditions it is shown ... consisting of 500 unconstrained optimization test problems, show that this new scaled conjugate gradient algorithm...
  • SPGL1

  • Referenced in 199 articles [sw08365]
  • gives an explicit relationship to two other optimization problems closely related to BPDN. We describe ... root-finding algorithm for finding arbitrary points on this curve; the algorithm is suitable ... Numerical experiments on a comprehensive set of test problems demonstrate that the method scales well...
  • cuFFT

  • Referenced in 24 articles [sw11258]
  • floating-point power and parallelism of the GPU in a highly optimized and tested...
  • MarPlex

  • Referenced in 26 articles [sw06750]
  • paper discusses the importance of a starting point in the simplex algorithm. Three different methods ... numerical test examples. We show that our two methods on the Netlib test problems have ... initial solution. The comparison of the introduced optimization softwares is based on the number ... required CPU time. It is pointed out that on average it takes more iterations...
  • ORBIT

  • Referenced in 39 articles [sw20552]
  • derivative-free algorithm, ORBIT, for unconstrained local optimization of computationally expensive functions. A trust-region ... ensuring that a subset of the interpolation points is sufficiently poised for linear interpolation ... method for adding additional points. We present numerical results on test problems to motivate ... problems, calibration of a watershed model and optimization of a PDE-based bioremediation plan...
  • ADBASE

  • Referenced in 64 articles [sw08460]
  • linear program is described. To create MOLP test problems, models for random problem generation ... paper, the numbers of efficient extreme points possessed by MOLPs (including multiple objective transportation problems ... utility values of the efficient extreme points might be distributed over the efficient ... should be easier to find good near- optimal solutions with linear utility functions than with...
  • RSVM

  • Referenced in 55 articles [sw15261]
  • thrown away after solving the optimization problem. This is achieved by making ... data points while the rows of Ā represent a greatly reduced data points. Computational results ... indicate that test set correctness for the reduced support vector machine (RSVM), with a nonlinear...
  • MLMSRBF

  • Referenced in 46 articles [sw07571]
  • evaluated points. We develop a global optimization version and a multistart local optimization version ... alternative global optimization methods, including a multistart derivative-based local optimization method. Multiple trials ... algorithms were compared on 17 multimodal test problems and on a 12-dimensional groundwater bioremediation...
  • CppAD

  • Referenced in 37 articles [sw04866]
  • include parametric optimization, saddle point problems, Benders decompositions, and multilevel optimization. In this paper ... implicitly defined functions for application to optimal value functions. The formulation we develop is well ... evaluation of first and second derivatives of optimal values. The result is a method that ... these comparisons is included to aid testing with other hardware and compilers, other AD packages...
  • GLOPTLAB

  • Referenced in 16 articles [sw02776]
  • satisfaction problems. Global Optimization Laboratory is an easy-to-use testing and development platform ... hence it is guaranteed that no feasible point is lost. As the name suggests GloptLab...
  • ZQPCVX

  • Referenced in 34 articles [sw08459]
  • faster one can be unstable, but numerical testing on some difficult problems indicates that both ... available quadratic programming subroutines that employ feasible point methods, namely QPSOL [see P. E. Gill ... quadratic programming”, Report SOL 83-7, Systems Optim. Lab., Rept. Oper. Res., Stanford Univ...
  • DFLGEN

  • Referenced in 9 articles [sw36986]
  • proposed algorithms globally converge to points satisfying different necessary optimality conditions. We report a computational ... derivative-free optimization software package, i.e., NOMAD, on a set of test problems. Furthermore ... solve a real problem concerning the optimal design of an industrial electric motor. This allows ... method converging to the better extended stationary points obtains the best solution also from...
  • Mosel

  • Referenced in 37 articles [sw04911]
  • developing, testing and deploying optimization applications. Development and analysis of optimization models written with ... decomposition and concurrent solving from a modeling point of view, with example implementations in Mosel...
  • McIPM

  • Referenced in 11 articles [sw07097]
  • point methods present a unified novel approach for solving linear optimization and conic optimization problems ... equation system are explored as well. Extensive testing shows that the McIPM package is competitive ... performance of interior point method software when solving difficult linear optimization problems, and offers avenues...
  • TATOO

  • Referenced in 3 articles [sw02253]
  • points-to and escape analysis developed for compiler optimization to address the software testing issues...
  • SO-I

  • Referenced in 15 articles [sw10100]
  • genetic algorithm, Nonsmooth Optimization by Mesh Adaptive Direct Search (NOMAD), SO-MI (M”uller ... local search has been compared on 17 test problems from the literature, and on eight ... able to find feasible points by employing a first optimization phase that aims at minimizing...
  • GsymPoint

  • Referenced in 1 article [sw40264]
  • Generalized Symmetry Point, an Optimal Cutpoint in Continuous Diagnostic Tests. Estimation of the cutpoint defined ... Symmetry point in a binary classification setting based on a continuous diagnostic test or marker ... implemented to construct confidence intervals for this optimal cutpoint, one based on the Generalized Pivotal...