Found 1684 packages in 0.02 seconds
Derivative-Free Optimization Algorithms by Quadratic Approximation
Derivative-free optimization by quadratic approximation based on an interface to Fortran implementations by M. J. D. Powell.
Derivative-Free Optimization
Derivative-Free optimization algorithms. These algorithms do not require gradient information. More importantly, they can be used to solve non-smooth optimization problems.
R Version of GENetic Optimization Using Derivatives
A genetic algorithm plus derivative optimizer.
'HiGHS' Optimization Solver
R interface to 'HiGHS', an optimization solver for solving mixed integer optimization problems with quadratic or linear objective and linear constraints.
Disciplined Convex Optimization
An object-oriented modeling language for disciplined
convex programming (DCP) as described in Fu, Narasimhan, and Boyd
(2020,
Hyperparameter Optimization for 'mlr3'
Hyperparameter optimization package of the 'mlr3' ecosystem. It features highly configurable search spaces via the 'paradox' package and finds optimal hyperparameter configurations for any 'mlr3' learner. 'mlr3tuning' works with several optimization algorithms e.g. Random Search, Iterated Racing, Bayesian Optimization (in 'mlr3mbo') and Hyperband (in 'mlr3hyperband'). Moreover, it can automatically optimize learners and estimate the performance of optimized models with nested resampling.
Trust Region Optimization
Does local optimization using two derivatives and trust regions. Guaranteed to converge to local minimum of objective function.
Solving and Optimizing Large-Scale Nonlinear Systems
Barzilai-Borwein spectral methods for solving nonlinear system of equations, and for optimizing nonlinear objective functions subject to simple constraints. A tutorial style introduction to this package is available in a vignette on the CRAN download page or, when the package is loaded in an R session, with vignette("BB").
Constrained Nonlinear Optimization
Augmented Lagrangian Adaptive Barrier Minimization Algorithm for optimizing smooth nonlinear objective functions with constraints. Linear or nonlinear equality and inequality constraints are allowed.
General-Purpose Unconstrained Non-Linear Optimization
An algorithm for general-purpose unconstrained non-linear optimization. The algorithm is of quasi-Newton type with BFGS updating of the inverse Hessian and soft line search with a trust region type monitoring of the input to the line search algorithm. The interface of 'ucminf' is designed for easy interchange with 'optim'.