Search Results for "nonlinear optimization"

JuMP is a modeling language and collection of supporting packages for mathematical optimization in Julia. JuMP makes it easy to formulate and solve a range of problem classes, including linear programs, integer programs, conic programs, semidefinite programs, and constrained nonlinear programs. JuMP is used to solve large-scale inventory routing problems at Renault, schedule trains at Thales Inc., plan power grid expansion at PSR, and route school buses.

...It is entirely written in Pascal and does not depend on external libraries. LMath provides routines and demo programs for numerical analysis, including mathematical functions, probabilities, matrices, optimization, linear and nonlinear equations, integration, Fast Fourier Transform, random numbers, curve fitting, statistics and graphics. It is organized s set of lazarus packages which makes it easily extensible and helps to include only really needed features in your project.

NOMAD is a C++ code that implements the MADS algorithm (Mesh Adaptive Direct Search) for difficult blackbox optimization problems. Such problems occur when the functions to optimize are costly computer simulations with no derivatives.

JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance, the tool enables to check all examples in the PVS Bernstein testsuite within a second, which can be an order of magnitude faster than some other tools such as QEPCAD or REDLOG. ...

Highly tunable, simple to use collection of the templates, containing a set of classes for solving unconstrained large scale nonlinear optimization problems. Currently it contains: -- Limited Memory Quasi Newton (L-BFSG) -- BFSG -- Conjugate Gradient -- Gradient Descent -- Wolf condition Line Search -- Backtracking Line Search -- Exact Golden Search -- Golden Search with Wolf condition We also distribute a set of tests with the library.

...MTL was used to build a 3d Scanner. MTL consists of pars B - Basic Functions, Matrices, Images, Hypermodels (3d Models and up) N - Numeric Functions ranging from linear regression over nonlinear optimization to singular-value computation I - Image filters and Image enhancement H - Hardware related (optional part), does require additional libraries and is only useful on certain hosts. G - Hyper-Model functions such as ray-plane intersections etc.

[PROJECT MIGRATED TO GIT-HUB] OptLib is a library of nonlinear optimization routines focused on the use of stochastic methods, including Simulated Annealing, Genetic Algorithms, and Monte Carlo. Routines are parallelized using MPI.

A Python environment for large and sparse linear and nonlinear optimization using intuitive interfaces to linear algebra tools and subproblem solvers written in low-level languages. It provides building blocks to experiment with new ideas and algorithms.