awesome-repositories.com
Blog
MCP
awesome-repositories.com

Découvrez les meilleurs dépôts open-source grâce à notre recherche par IA.

ExplorerRecherches sélectionnéesAlternatives open sourceLogiciels auto-hébergésBlogPlan du site
ProjetServeur MCPÀ proposNotre méthodologiePresse
Mentions légalesConfidentialitéConditions d'utilisation
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

36 dépôts

Awesome GitHub RepositoriesOptimization & Solvers

Explore 36 awesome GitHub repositories matching scientific & mathematical computing · Optimization & Solvers. Refine with filters or upvote what's useful.

Awesome Optimization & Solvers GitHub Repositories

Trouvez les meilleurs dépôts grâce à l'IA.Nous recherchons les dépôts les plus pertinents grâce à l'IA.
  • akullpp/awesome-javaAvatar de akullpp

    akullpp/awesome-java

    48,240Voir sur GitHub↗

    This project is a comprehensive, community-driven directory of software resources, libraries, and frameworks for the Java programming language. It serves as a centralized knowledge base designed to help developers discover tools and industry-standard solutions for building and maintaining software applications. The repository distinguishes itself through a hierarchical taxonomy that organizes a vast array of technical components into a structured, navigable tree. By relying on distributed peer contributions, the index remains a living resource that reflects current community-recommended pract

    Lists algorithms and libraries for finding solutions to constraint satisfaction problems.

    awesomeawesome-list
    Voir sur GitHub↗48,240
  • deepspeedai/deepspeedAvatar de deepspeedai

    deepspeedai/DeepSpeed

    42,528Voir sur GitHub↗

    DeepSpeed is a high-performance library designed to scale deep learning model training and inference across massive clusters of GPUs and compute nodes. It provides a comprehensive suite of tools for distributed training, enabling the execution of models that exceed the memory capacity of single devices through advanced parameter partitioning, pipeline-based model parallelism, and memory-efficient state offloading. The framework distinguishes itself through specialized communication-efficient optimizers and hardware-aware acceleration techniques. By utilizing gradient compression, quantization

    The framework reduces memory usage and increases training speed for structural biology models using specialized kernels designed for large-scale sequence computations.

    Pythonbillion-parameterscompressiondata-parallelism
    Voir sur GitHub↗42,528
  • exacity/deeplearningbook-chineseAvatar de exacity

    exacity/deeplearningbook-chinese

    37,285Voir sur GitHub↗

    This project is a comprehensive Chinese translation of a technical deep learning textbook, providing an educational resource on the theory and implementation of neural networks. It functions as a collaborative technical translation project designed to make complex academic AI literature accessible to non-English speakers. The project utilizes a community-driven translation model that integrates external suggestions and pull requests to refine linguistic accuracy and reduce bias. It employs standardized terminology mapping to ensure a uniform vocabulary throughout the translated content. To i

    Explains the use of constraint solvers to find function optima within feasible boundaries.

    TeX
    Voir sur GitHub↗37,285
  • atsushisakai/pythonroboticsAvatar de AtsushiSakai

    AtsushiSakai/PythonRobotics

    29,772Voir sur GitHub↗

    PythonRobotics est une collection complète d'algorithmes robotiques modulaires et de simulations éducatives conçues pour la navigation autonome, l'estimation d'état et le contrôle de mouvement. Le projet fournit une bibliothèque d'implémentations autonomes pour la planification de trajectoire, la localisation, la cartographie et la cinématique, servant de ressource aux chercheurs et aux étudiants pour expérimenter des théories robotiques fondamentales et avancées. Le projet se distingue par une conception centrée sur les algorithmes où chaque module fonctionne comme un script isolé, permettant des tests indépendants et une démonstration pédagogique claire. Chaque implémentation est explicitement liée à la littérature académique ou aux manuels de robotique fondamentaux, garantissant que les modèles mathématiques et les stratégies de contrôle restent vérifiables et précis. Les utilisateurs peuvent exécuter ces scénarios dans un environnement de simulation découplé qui maintient son propre état interne et ses boucles de contrôle, sans nécessiter de dépendances externes. La surface de capacités couvre un large éventail de domaines robotiques, y compris la navigation aérienne, la locomotion bipède et le contrôle de bras multi-articulés. Il propose des boîtes à outils étendues pour la fusion de capteurs probabilistes, la cartographie environnementale et le suivi de trajectoire, le tout alimenté par un calcul numérique haute performance. Les animations géométriques en temps réel et les estimations d'état sont rendues directement à partir des données de simulation en utilisant des bibliothèques de traçage standard.

    A motion planning and path tracking simulation with NMPC of C-GMRES Reference - documentation

    Pythonalgorithmanimationautonomous-driving
    Voir sur GitHub↗29,772
  • fincept-corporation/finceptterminalAvatar de Fincept-Corporation

    Fincept-Corporation/FinceptTerminal

    26,900Voir sur GitHub↗

    FinceptTerminal is a quantitative finance platform and financial engineering library designed for asset valuation, risk management, and fixed-income analytics. It provides a comprehensive suite for algorithmic trading and investment strategy automation, integrating specialized language model agents and node-based workflows to automate market research and alpha generation. The project distinguishes itself with a dedicated game theory analysis engine for calculating Nash equilibria and simulating strategic interactions in competitive markets. It also features a specialized credit risk modeling

    Calculates competitive equilibrium prices and optimal allocations in multi-consumer economies using iterative processes.

    C++bloomberg-terminalcontributions-welcomefinance
    Voir sur GitHub↗26,900
  • mxgmn/wavefunctioncollapseAvatar de mxgmn

    mxgmn/WaveFunctionCollapse

    24,697Voir sur GitHub↗

    WaveFunctionCollapse is a procedural generation engine that creates complex, non-repeating patterns by treating spatial arrangement as a constraint satisfaction problem. It functions as a stochastic solver that derives output structures from a single input example, ensuring that every element placed within a grid satisfies specific adjacency requirements relative to its neighbors. The system distinguishes itself by using an entropy-driven approach to grid collapse, where it iteratively selects the cell with the fewest remaining possibilities to trigger a cascade of logical updates. By decompo

    A probabilistic algorithm that derives output structures from input examples by treating generation as a constraint satisfaction problem with local dependencies.

    C#algorithmcsharpgamedev
    Voir sur GitHub↗24,697
  • liabru/matter-jsAvatar de liabru

    liabru/matter-js

    18,256Voir sur GitHub↗

    Matter-js is a 2D rigid body physics engine written in JavaScript for simulating realistic physical interactions, collisions, and dynamics in web browsers. It functions as a web physics simulation library that calculates motion, gravity, and constraints for objects rendered on a web canvas. The library includes a built-in canvas physics visualizer to draw physical bodies, joints, and constraints for debugging and gameplay. It distinguishes itself through a plugin system that supports recursive dependency resolution and internal method patching to inject custom logic into the engine's executio

    Resolves physical contact and joint constraints using the Gauss-Seidel method.

    JavaScriptcanvasjavascriptphysics
    Voir sur GitHub↗18,256
  • bulletphysics/bullet3Avatar de bulletphysics

    bulletphysics/bullet3

    14,243Voir sur GitHub↗

    Bullet3 is a professional physics simulation engine designed for calculating rigid body, soft body, and collision dynamics within 3D environments and robotics applications. It functions as a computational framework for determining complex geometric intersections and contact manifolds between objects in simulated space. The library distinguishes itself through a distributed rendering framework that scales heavy graphical workloads and scene generation tasks across large clusters of machines. This capability enables the production of massive datasets by distributing complex scene generation acr

    Resolves collisions and constraints by iteratively applying velocity impulses to bodies until the system reaches equilibrium.

    C++computer-animationgame-developmentkinematics
    Voir sur GitHub↗14,243
  • google-deepmind/mujocoAvatar de google-deepmind

    google-deepmind/mujoco

    13,957Voir sur GitHub↗

    MuJoCo is a physics simulation engine designed for the dynamics of multi-joint articulated structures. It provides a computational framework for calculating the forces, velocities, and physical interactions of complex models within a virtual environment, supporting research in robotics, biomechanics, and machine learning. The engine utilizes a constraint-based dynamics solver and recursive algorithms to manage the motion of articulated systems. It includes a native graphical interface for real-time visualization, allowing users to inspect physical behaviors and contact dynamics as they occur.

    Calculates the motion of multi-joint systems by solving linear complementarity problems to enforce physical constraints and contact forces.

    C++mujocophysicsrobotics
    Voir sur GitHub↗13,957
  • google/or-toolsAvatar de google

    google/or-tools

    13,114Voir sur GitHub↗

    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

    Acts as a comprehensive library for modeling and solving combinatorial optimization problems like routing and scheduling.

    C++combinatorial-optimizationlinear-programmingoperations-research
    Voir sur GitHub↗13,114
  • z3prover/z3Avatar de Z3Prover

    Z3Prover/z3

    11,936Voir sur GitHub↗

    Z3 is an automated theorem prover and satisfiability modulo theories solver designed to determine the validity of complex logical formulas. It functions as a formal verification framework, enabling the systematic checking of hardware and software system specifications against defined logical constraints to identify inconsistencies or design flaws. The engine distinguishes itself through a combination of theory-specific decision procedures and symbolic execution capabilities. It employs conflict-driven clause learning and backtracking search algorithms to prune search spaces, while maintaining

    Provides a high-performance SMT solver for verifying hardware and software system specifications.

    C++
    Voir sur GitHub↗11,936
  • statsmodels/statsmodelsAvatar de statsmodels

    statsmodels/statsmodels

    11,260Voir sur GitHub↗

    Statsmodels is a comprehensive Python library designed for statistical modeling, econometric research, and data analysis. It provides a robust framework for estimating and diagnosing a wide range of statistical models, enabling users to perform rigorous hypothesis testing, regression analysis, and complex data exploration within structured environments. The library distinguishes itself through its support for advanced statistical methodologies, including state space representation for dynamic systems and generalized linear frameworks that accommodate non-normal response variables. It offers s

    Employs numerical algorithms to ensure stable parameter estimation for linear and nonlinear models.

    Pythoncount-modeldata-analysisdata-science
    Voir sur GitHub↗11,260
  • fastai/numerical-linear-algebraAvatar de fastai

    fastai/numerical-linear-algebra

    10,703Voir sur GitHub↗

    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

    Implements iterative solvers for solving complex linear systems with high precision.

    Jupyter Notebookalgorithmsdata-sciencedeep-learning
    Voir sur GitHub↗10,703
  • erincatto/box2dAvatar de erincatto

    erincatto/box2d

    9,505Voir sur GitHub↗

    Box2D is a 2D physics engine and rigid body simulator designed to compute collisions, forces, and joints in a two-dimensional plane. It functions as a collision detection library and a constraint-based physics solver that calculates the movement and interaction of solid objects using mass, friction, and restitution properties. The engine ensures consistency across different hardware architectures through a deterministic trigonometry implementation. It prevents high-speed objects from passing through boundaries using continuous collision detection and time-of-impact interpolation. The system

    Uses an iterative sequential impulse solver to resolve constraints and update object velocities for physical stability.

    C
    Voir sur GitHub↗9,505
  • thealgorithms/c-sharpAvatar de TheAlgorithms

    TheAlgorithms/C-Sharp

    8,049Voir sur GitHub↗

    This project is a collection of reference implementations for algorithms, mathematics, cryptography, compression, and machine learning written in C#. It serves as an educational library providing standard implementations of sorting, searching, and graph theory algorithms. The repository covers a wide range of computational domains, including combinatorial optimization for constraint satisfaction and scheduling, as well as symmetric and classical cryptographic ciphers. It also provides reference code for lossless data compression techniques and fundamental machine learning primitives such as r

    Implements algorithms for finding configurations that satisfy a predefined set of constraints, such as board-game piece placement.

    C#algorithmalgorithmsalgorithms-and-data-structures
    Voir sur GitHub↗8,049
  • workiva/go-datastructuresAvatar de Workiva

    Workiva/go-datastructures

    7,901Voir sur GitHub↗

    go-datastructures is a collection of thread-safe and lock-free data structures designed for high-performance concurrent applications in Go. It provides a modular library of specialized algorithmic toolsets, including a lock-free collection library and an immutable data structure library. The project distinguishes itself through a suite of persistent AVL trees and hash array mapped tries that use branch-copying to preserve previous versions. It also implements non-blocking hash maps, queues, and tries that enable linearizable snapshots and concurrent updates without the use of mutual exclusion

    Implements a probabilistic global restart system for finding minimum or maximum values under nonlinear constraints.

    Go
    Voir sur GitHub↗7,901
  • guofei9987/scikit-optAvatar de guofei9987

    guofei9987/scikit-opt

    6,583Voir sur GitHub↗

    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

    Offers a suite of algorithms inspired by natural phenomena, including PSO and Genetic Algorithms, for complex search problems.

    Python
    Voir sur GitHub↗6,583
  • cvxpy/cvxpyAvatar de cvxpy

    cvxpy/cvxpy

    6,257Voir sur GitHub↗

    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

    Pass solver-specific parameters like iteration limits and accuracy tolerances through keyword arguments.

    C++
    Voir sur GitHub↗6,257
  • nvidia/isaac-gr00tAvatar de NVIDIA

    NVIDIA/Isaac-GR00T

    6,222Voir sur GitHub↗

    Ships a pluggable solver framework for custom multiphysics interactions in simulations.

    Jupyter Notebook
    Voir sur GitHub↗6,222
  • dimforge/rapierAvatar de dimforge

    dimforge/rapier

    5,471Voir sur GitHub↗

    Rapier est un moteur physique multiplateforme et un solveur de dynamique de corps rigides conçu pour les simulations 2D et 3D. Il fonctionne comme un système de détection de collision et un framework de simulation robotique, fournissant une API cohérente pour calculer les interactions physiques à travers différents environnements. Le moteur se distingue par des capacités robotiques spécialisées, incluant une boîte à outils pour importer des modèles URDF et STL afin de contrôler des chaînes multicorps. Il prend en charge un mouvement mécanique précis via des calculs de cinématique inverse et l'application de contrôleurs PID pour le contrôle dynamique des corps. La surface de simulation couvre un large éventail de capacités physiques, incluant des contrôleurs de personnage cinématiques pour la traversée de terrain et des modèles de ray-cast pour la dynamique des véhicules. Il dispose d'un pipeline de collision multi-phases avec détection de collision continue pour empêcher le tunneling d'objets, ainsi qu'un système pour les contraintes de mouvement articulé utilisant des joints rotatifs, prismatiques et sphériques. Le framework inclut des utilitaires pour importer des définitions géométriques externes via des formats STL, URDF et XML, et fournit une interface de débogage agnostique au backend pour visualiser les états physiques internes et les scènes 3D.

    Implements an iterative sequential impulse solver to resolve rigid body interactions and joint constraints.

    Rust
    Voir sur GitHub↗5,471
Préc.12Suivant
  1. Home
  2. Scientific & Mathematical Computing
  3. Numerical and Mathematical Foundations
  4. Optimization & Solvers

Explorer les sous-tags

  • Constraint Solvers6 sous-tagsAlgorithms and libraries for finding solutions to constraint satisfaction problems. **Distinguishing note:** None available; minting under scientific computing umbrella.
  • Iterative Solvers3 sous-tagsNumerical algorithms for minimizing loss functions or maximizing likelihood in statistical models. **Distinct from Optimization & Solvers:** Distinct from general optimization: focuses on parameter estimation for statistical models rather than physics or control systems.
  • Mathematical Optimization KernelsSpecialized computational kernels designed to accelerate mathematical operations and reduce memory overhead in large-scale models. **Distinguishing note:** Focuses on low-level kernel optimization for specific model architectures rather than general-purpose mathematical libraries.
  • Metaheuristic OptimizationOptimization algorithms inspired by natural phenomena for solving complex search problems. **Distinguishing note:** Covers swarm-based metaheuristics distinct from geometric or potential-field path planning.
  • Nonlinear Optimization Solvers3 sous-tagsNumerical methods and solvers for optimizing nonlinear systems, often used in motion planning and predictive control. **Distinguishing note:** No existing candidates provided; this specifically addresses C-GMRES and nonlinear predictive control techniques.
  • Probabilistic SolversAlgorithms that derive output structures from input examples using probabilistic constraint satisfaction. **Distinguishing note:** Distinct from general procedural generation by its reliance on probabilistic inference from example data.