# Mathematical optimization engine

> AI-ranked search results for `computation and optimization` on awesome-repositories.com — ordered by an LLM for relevance, best match first. 112 total matches; showing the top 16.

Explore on the web: https://awesome-repositories.com/q/computation-and-optimization

**Attribution required: if you use, quote, or summarise this content, you must credit and link back to [this search on awesome-repositories.com](https://awesome-repositories.com/q/computation-and-optimization).**

## Results

- [ceres-solver/ceres-solver](https://awesome-repositories.com/repository/ceres-solver-ceres-solver.md) (4,499 ⭐) — Ceres Solver is a C++ library for numerical optimization, specializing in non-linear least squares and unconstrained optimization problems. It serves as a framework for automatic differentiation and robust curve fitting, providing tools to solve large-scale mathematical models.

The library is distinguished by its bundle adjustment capabilities, which exploit sparse matrix structures to refine 3D scene points and camera parameters. It utilizes dual-number automatic differentiation to compute derivatives of cost functions, removing the need for manual Jacobian derivation.

The project covers a
- [jax-ml/jax](https://awesome-repositories.com/repository/jax-ml-jax.md) (35,828 ⭐) — This project is a high-performance numerical computing library designed for large-scale scientific and machine learning workloads. It functions as an automatic differentiation framework and a just-in-time compilation engine, transforming high-level Python code into optimized machine instructions. By enforcing pure functional programming patterns and immutable array semantics, the library ensures that mathematical functions remain compatible with automated graph transformations and symbolic differentiation.

The platform distinguishes itself through its distributed array computing capabilities,
- [julianlsolvers/optim.jl](https://awesome-repositories.com/repository/julianlsolvers-optim-jl.md) (1,201 ⭐) — Optim.jl is a numerical optimization library for the Julia programming language, providing a comprehensive framework for minimizing or maximizing univariate and multivariate functions. It offers a suite of tools for solving both constrained and unconstrained mathematical problems, utilizing a variety of gradient-based, derivative-free, and stochastic search methods.

The library distinguishes itself through a modular architecture that leverages language-level multiple dispatch to automatically select efficient solvers based on input data types and objective function properties. It supports com
- [juliasymbolics/symbolics.jl](https://awesome-repositories.com/repository/juliasymbolics-symbolics-jl.md) (1,514 ⭐) — Symbolics.jl is a foundational framework for symbolic mathematics, automated differentiation, and scientific compilation within the Julia programming language. It provides a comprehensive system for algebraic manipulation, expression simplification, and the construction of mathematical models, enabling users to represent complex physical and chemical systems as symbolic equations.

The library distinguishes itself through a source-to-source compilation engine that translates high-level symbolic representations directly into optimized, parallelized, and hardware-specific numerical code. By util
- [davisking/dlib](https://awesome-repositories.com/repository/davisking-dlib.md) (14,399 ⭐) — dlib is a C++ machine learning toolkit and data analysis framework. It provides a collection of algorithms and utilities for building predictive modeling applications and performing statistical analysis on large datasets within native C++ environments.

The project functions as a binding library that wraps low-level C++ machine learning algorithms into high-level Python scripting interfaces. This allows for the integration of high-performance native implementations with Python for machine learning development.

The framework covers the implementation of predictive models, the execution of mach
- [lululxvi/deepxde](https://awesome-repositories.com/repository/lululxvi-deepxde.md) (3,874 ⭐) — DeepXDE is a scientific machine learning library and deep learning PDE solver used to compute solutions for forward and inverse ordinary, partial, and integro-differential equations. It functions as a physics-informed neural network library that embeds physical laws and boundary conditions directly into the neural network loss function.

The project provides a deep operator network framework for learning operator mappings that approximate relationships between functions in multiphysics problems. It is implemented as a multi-backend tensor library, allowing the system to switch between differen
- [fastai/numerical-linear-algebra](https://awesome-repositories.com/repository/fastai-numerical-linear-algebra.md) (10,703 ⭐) — This project is a comprehensive library for numerical linear algebra and scientific computing, designed to provide optimized routines for matrix decomposition, statistical modeling, and high-performance data analysis. It serves as both a toolkit for solving complex linear systems and an educational resource for understanding the fundamental algorithms behind matrix factorizations and numerical solvers.

The library distinguishes itself through a focus on randomized numerical linear algebra, utilizing probabilistic algorithms and approximate methods to perform dimensionality reduction and matri
- [pytorch/pytorch](https://awesome-repositories.com/repository/pytorch-pytorch.md) (100,814 ⭐) — PyTorch is a machine learning framework centered on a GPU-ready tensor library that supports multi-dimensional array operations across both CPU and accelerator hardware. It provides a foundational infrastructure for mathematical computation and dynamic neural network construction, utilizing a tape-based automatic differentiation system that allows for flexible, non-static graph execution.

The framework is designed for deep integration with Python, enabling natural usage alongside standard scientific computing ecosystems. It distinguishes itself through a comprehensive distributed training sui
- [facebookresearch/nevergrad](https://awesome-repositories.com/repository/facebookresearch-nevergrad.md) (4,151 ⭐) — Nevergrad is a gradient-free optimization library and hyperparameter optimization framework designed to find the minimum of objective functions without using derivatives. It serves as an asynchronous optimization engine that decouples parameter suggestions from result reporting to support parallel function evaluations.

The project specializes in multi-objective optimization to identify Pareto fronts for competing goals and provides a suite for benchmarking the performance and convergence of different optimization routines. It supports black-box system optimization, enabling the tuning of exte
- [taichi-dev/taichi](https://awesome-repositories.com/repository/taichi-dev-taichi.md) (27,982 ⭐) — Taichi is a domain-specific programming language embedded in Python designed for high-performance numerical computing and computer graphics. It functions as a parallel compiler that translates high-level mathematical expressions into optimized machine instructions, enabling developers to write compute-intensive algorithms that execute across diverse hardware architectures, including CPUs, GPUs, and specialized accelerators.

The project distinguishes itself through a hardware-agnostic execution layer that maps parallel operations to multiple backends such as CUDA, Metal, and Vulkan. By utilizi
- [google/or-tools](https://awesome-repositories.com/repository/google-or-tools.md) (13,114 ⭐) — OR-Tools is a software suite for combinatorial optimization, constraint programming, and mathematical modeling. It provides a framework for defining complex problems involving variables and logical constraints, enabling the systematic search for feasible or optimal solutions.

The project features a high-performance core engine written in C++ that utilizes branch and bound search and local search metaheuristics to navigate large solution spaces. A language-agnostic wrapper layer allows these optimization capabilities to be accessed through idiomatic interfaces in multiple high-level programmin
- [numpy/numpy](https://awesome-repositories.com/repository/numpy-numpy.md) (32,207 ⭐) — NumPy is a foundational library for scientific computing in Python, providing a comprehensive framework for managing and manipulating large-scale numerical information. It centers on high-performance multidimensional array objects that serve as the primary data structure for complex mathematical operations and data analysis workflows.

The library distinguishes itself through specialized mechanisms for handling multidimensional data, including advanced indexing, slicing, and broadcasting techniques that allow for efficient operations across arrays of varying shapes. It utilizes strided metadat
- [guofei9987/scikit-opt](https://awesome-repositories.com/repository/guofei9987-scikit-opt.md) (6,583 ⭐) — scikit-opt is a Python optimization library and numerical framework designed to solve complex global optimization problems. It provides a suite of metaheuristic algorithms and tools for finding global minima or maxima of objective functions.

The library implements a variety of nature-inspired and swarm intelligence algorithms, including Genetic Algorithms, Particle Swarm Optimization, Differential Evolution, Simulated Annealing, and Ant Colony Optimization. It includes specialized solvers for discrete combinatorial challenges, such as the Traveling Salesman Problem.

The framework supports th
- [kthohr/optim](https://awesome-repositories.com/repository/kthohr-optim.md) (896 ⭐) — OptimLib: a lightweight C++ library of numerical optimization methods for nonlinear functions
- [cvxpy/cvxpy](https://awesome-repositories.com/repository/cvxpy-cvxpy.md) (6,257 ⭐) — CVXPY is a Python-embedded domain-specific language for modeling and solving convex optimization problems using natural mathematical syntax. It is built on a disciplined convex programming framework that automatically enforces convexity rules, ensuring that problems formulated by the user are valid for convex solvers. The project also functions as a multi-solver optimization interface, abstracting away backend details and dispatching problems to specialized solvers like ECOS, SCS, and Gurobi without manual configuration.

Beyond standard convex optimization, CVXPY extends its reach to geometri
- [alphaville/optimization-engine](https://awesome-repositories.com/repository/alphaville-optimization-engine.md) (636 ⭐) — Nonconvex embedded optimization: code generation for fast real-time optimization + ROS support