### Search Results:

Showing results 1 to 10 of 1,041.

##### Function genopt[BurStMisc v1.1]
keywords
optimize
title
Genetic Optimization
description
Approximately minimizes the value of a function using a simple heuristic optimizer that uses a combination of genetic and simulated annealing optimization.
##### Function genopt.control[BurStMisc v1.1]
keywords
optimize
title
Control parameters for genopt
description
Returns a list suitable as the control argument of the genopt function.
##### Function summary.genopt[BurStMisc v1.1]
keywords
optimize
title
Summary of genopt object
description
The call, best solution and summary of objectives in the final population.
##### Function cmaes[cmaesr v1.0.3]
keywords
optimize
title
description
Performs non-linear, non-convex optimization by means of the Covariance Matrix Adaptation - Evolution Strategy (CMA-ES).
##### Function Rcplex[Rcplex v0.3-3]
keywords
optimize
title
Solve optimization problem with CPLEX
description
Interface to CPLEX solvers for linear quadratic and (linear or quadratic) mixed-integer programs. The general statement of the problem is $$\min \frac{1}{2}x'Qx + c'x$$ $$\mathrm{s.t} Ax \leq b$$ $$lb \leq x \leq ub$$ If Q==NULL then the problem is linear, if any value of the vtype argument is "B" or "I" then the problem is a mixed-integer program. The control argument is used to set CPLEX's many parameters. See details. The objsense determines if the problem is a maximization or minimization problem. The sense argument is used to set the constraint directions.
##### Function Rcplex_solve_QCP[Rcplex v0.3-3]
keywords
optimize
title
Solve quadratically constrained optimization problem with CPLEX
description
Interface to CPLEX solvers for quadratically constrained linear, quadratic, and mixed-integer programs. The general statement of the problem is $$\min \frac{1}{2}x'Qx + c'x$$ $$\mathrm{s.t} Ax \leq b$$ $$\mathrm{and} a_i'x + x'Q_ix \leq r_i for i=1,\ldots,q$$ $$lb \leq x \leq ub$$ If Q==NULL then the problem is linear, if any value of the vtype argument is "B" or "I" then the problem is a mixed-integer program. The control argument is used to set CPLEX's many parameters. See details. The objsense determines if the problem is a maximization or minimization problem. The sense argument is used to set the constraint directions.
##### Function kern_smooth[npbr v1.6]
keywords
optimize
title
Frontier estimation via kernel smoothing
description
The function kern_smooth implements two frontier estimators based on kernel smoothing techniques. One is from Noh (2014) and the other is from Parmeter and Racine (2013).
##### Function kern_smooth_bw[npbr v1.6]
keywords
optimize
title
Bandwidth selection for kernel smoothing frontier estimators
description
The function kern_smooth_bw provides two bandwidth selection methods. One is the least squares cross-validation developed by Parmeter and Racine (2013). The other is the BIC developed in Noh (2014).
##### Function loc_est[npbr v1.6]
keywords
optimize
title
Local linear frontier estimator
description
Computes the local linear smoothing frontier estimator of Hall, Park and Stern (1998) and Hall and Park (2004).
##### Function loc_est_bw[npbr v1.6]
keywords
optimize
title
Bandwidth selection for the local linear frontier estimator
description
Computes the optimal bootstrap bandwidth proposed by Hall and Park (2004) for the local linear frontier estimator.