Imports: DescTools, lavaan, WRS2, ggplot2, nptest, dplyr, fungible,

Title: Neighbourhood Functions for Local-Search Algorithms
Description: Neighbourhood functions are key components of
local-search algorithms such as Simulated Annealing or
Threshold Accepting.  These functions take a solution and
return a slightly-modified copy of it, i.e. a neighbour.
The package provides a function neighbourfun() that
constructs such neighbourhood functions, based on
parameters such as admissible ranges for elements in a
solution.  Supported are numeric and logical solutions.
The algorithms were originally created for
portfolio-optimisation applications, but can be used for
other models as well.  Several recipes for neighbour
computations are taken from "Numerical Methods and
Optimization in Finance" by M. Gilli, D. Maringer and

Title: Classification, Regression, Clustering with K Nearest Neighbors
Description: Classification, regression, and clustering with k nearest neighbors
algorithm. Implements several distance and similarity measures, covering
continuous and logical features. Outputs ranked neighbors. Most features of
this package are directly based on the PMML specification for KNN.
Suggests: testthat, knitr, rmarkdown, mlbench

Package: neldermead
Type: Package
Title: R port of the Scilab neldermead module
Version: 1.0-1
Date: 2010-05-05
Author: Sebastien Bihorel, Michael Baudin (author of the original
module)
Maintainer: Sebastien Bihorel <sb.pmlab@gmail.com>
Depends: optimbase, optimsimplex
Description: Provides several direct search optimization algorithms
based on the simplex method. The provided algorithms are direct
search algorithms, i.e. algorithms which do not use the
derivative of the cost function. They are based on the update
of a simplex. The following algorithms are available: the fixed
size simplex method of Spendley, Hext and Himsworth
(unconstrained optimization with a fixed sized simplex), the
variable size simplex method of Nelder and Mead (unconstrained
optimization with a variable sized simplex made of k=n+1
vertices), Box's complex method (constrained optimization with
a variable sized simplex).
License: CeCILL-2
LazyLoad: yes
Packaged: 2010-05-05 11:17:52 UTC; sebastien
Repository: CRAN
Date/Publication: 2010-05-05 11:27:02