• LIBSVM

  • Referenced in 1114 articles [sw04879]
  • solving SVM optimization problems theoretical convergence multiclass classification probability estimates and parameter selection are discussed...
  • MISER3

  • Referenced in 81 articles [sw04190]
  • discrete-time optimal control problems, optimal parameter selection problems, or a combination of both, subject...
  • SCALCG

  • Referenced in 102 articles [sw08453]
  • Beale–Powell. The parameter scaling the gradient is selected as spectral gradient ... consisting of 500 unconstrained optimization test problems, show that this new scaled conjugate gradient algorithm...
  • mlr

  • Referenced in 28 articles [sw12357]
  • classification and regression techniques, including machine-readable parameter descriptions. There is also an experimental extension ... optimization techniques, for single- and multi-objective problems. Filter and wrapper methods for feature selection...
  • ACGSSV

  • Referenced in 9 articles [sw20836]
  • Frobenius norm. Two variants of the parameter in the search direction are presented as those ... unconstrained optimization test problems, of different structure and complexity, we prove that selection ... scaling parameter in self-scaling memoryless BFGS update leads to algorithms which substantially outperform...
  • Sparsity

  • Referenced in 13 articles [sw08686]
  • SPARSITY system is designed to address these problems by allowing users to automatically build sparse ... provides a novel framework for selecting optimization parameters, such as block size, using a combination ... simulations, in particular finite-element problems. Cache level optimizations are important when the vector used ... speedups. We describe the different optimizations and parameter selection techniques and evaluate them on several...
  • RM-MEDA

  • Referenced in 35 articles [sw08554]
  • algorithm (RM-MEDA) for continuous multiobjective optimization problems with variable linkages. At each generation ... model thus built. A nondominated sorting-based selection is used for choosing solutions ... MEDA is not sensitive to algorithmic parameters, and has good scalability to the number...
  • SuperMann

  • Referenced in 8 articles [sw36949]
  • have recently gained popularity in convex optimization problems arising in various control fields. Being fixed ... high sensitivity to ill conditioning and parameter selection, and consequent low accuracy and robustness ... operator splitting schemes for structured convex optimization, overcoming their well known sensitivity to ill conditioning...
  • acebayes

  • Referenced in 12 articles [sw20243]
  • expected utility. Finding Bayesian optimal designs for realistic problems is challenging, as the expected utility ... Functions are provided for both bespoke design problems with user-defined utility functions ... step-change in the complexity of problems that can be addressed, enabling designs ... found for the goals of parameter estimation, model selection and prediction...
  • SNOBFIT

  • Referenced in 20 articles [sw05289]
  • robust and fast solution of noisy optimization problems with continuous variables varying within bound, possibly ... based interface; care is taken that the optimization proceeds reasonably even when the interface produces ... suitable for applications to the selection of continuous parameter settings for simulations or experiments, performed...
  • OptiML

  • Referenced in 3 articles [sw05117]
  • solving the SVM problem for a given value of parameter C, the C++ version includes ... ability compute a path of optimal. (3) SINCO (Sparse INverse COvariance) is the C++ software ... which solve the sparse inverse covariance selection problem. OptiML is released as open source code...
  • Opytimizer

  • Referenced in 1 article [sw31846]
  • Inspired Python Optimizer. Optimization aims at selecting a feasible set of parameters in an attempt ... solve a particular problem, being applied in a wide range of applications, such as operations ... control engineering, among others. Nevertheless, traditional iterative optimization methods use the evaluation of gradients...
  • ALINEA

  • Referenced in 2 articles [sw28024]
  • application of VRFT to a ramp metering problem of freeway traffic system. When there ... select a proper parameter of ALINEA, the VRFT approach is used to optimize the ALINEA...
  • LAHS

  • Referenced in 3 articles [sw16836]
  • harmony search (LAHS) for unconstrained optimization of continuous problems. The harmony search (HS) algorithm performance ... depends on the fine tuning of its parameters, including the harmony consideration rate (HMCR), pitch ... capabilities are employed in the HS to select these parameters based on spontaneous reactions...
  • rDecode

  • Referenced in 1 article [sw38627]
  • Optimal Direct Estimation. Algorithms for solving a self-calibrated l1-regularized quadratic programming problem without ... parameter tuning. The algorithm, called DECODE, can handle high-dimensional data without cross-validation ... found useful in high dimensional portfolio selection (see Pun (2018) ) and large...
  • SIDAC

  • Referenced in 1 article [sw09278]
  • face scientific problems such as solving differential equations, curve fitting, parameter estimation, etc. It employs ... helps to select the optimal form for solving a concrete problem. There are many commands...
  • ADATE

  • Referenced in 3 articles [sw02854]
  • finding good solutions to hard combinatorial optimization problems have attained a lot of success ... successes, and also with its own parameter settings and other method-specific details ... move selection part of BOOP-Boolean Optimization Problems. The baseline is a highly successful Tabu...
  • AMoRe

  • Referenced in 1 article [sw22911]
  • molecular replacement (AMoRe) program package. The basic problem of molecular replacement is to determine ... models placed at tentative positions and then selecting the configurations that give an acceptable agreement ... solved structures led to the optimization of the different parameters that define the rotation ... package, originally designed to deal with difficult problems, is a result of the combined action...
  • EPCM

  • Referenced in 3 articles [sw03458]
  • clustering results are strongly dependent on parameter selection and/or initialization; (2) the clustering accuracy ... often deteriorated due to its coincident clustering problem; (3) outliers can not be well labeled ... EPCM is realized by using an alternative optimization approach. The main advantage of EPCM lies...
  • PedPeel

  • Referenced in 1 article [sw10511]
  • problem for pedigrees with loops. However, the problem has not been solved for pedigrees without ... graph theoretic algorithm for optimal selection of peeling order in zero-loop pedigrees with incomplete ... calculation is needed, for example, when genetic parameters are estimated or linkage with multiple marker...