Search Results for "muti-objective optimization"

Optimization.jl provides the easiest way to create an optimization problem and solve it. It enables rapid prototyping and experimentation with minimal syntax overhead by providing a uniform interface to >25 optimization libraries, hence 100+ optimization solvers encompassing almost all classes of optimization algorithms such as global, mixed-integer, non-convex, second-order local, constrained, etc.

This package provides general guidelines to represent non-linear programming (NLP) problems in Julia and a standardized API to evaluate the functions and their derivatives. The main objective is to be able to rely on that API when designing optimization solvers in Julia.

A Julia package for non-smooth optimization algorithms. This package provides algorithms for the minimization of objective functions that include non-smooth terms, such as constraints or non-differentiable penalties.

Priorty Estimation Tool (PriEsT) is a decision analysis tool. You can use it for ranking the options you have, or alternatively, you may use it for resource allocation (budgeting) problems. In PriEsT, you enter a list of available options and then define your criteria for prioritization. After defining criteria, PriEsT allows you to enter your judgements against each criterion, which are then used to calculate the final ranking (or weights). Please cite this if you find it...

...Inheriting the use of Hoeffding bound in VFDT algorithm for node-splitting check, it contains four optional strategies of functional tree leaf, which improve the classifying accuracy. In addition, a multi-objective incremental optimization mechanism investigates a balance among accuracy, mode size and learning speed...