Showing 9 open source projects for "linear optimization"

View related business solutions
  • Go from Data Warehouse to Data and AI platform with BigQuery Icon
    Go from Data Warehouse to Data and AI platform with BigQuery

    Build, train, and run ML models with simple SQL. Automate data prep, analysis, and predictions with built-in AI assistance from Gemini.

    BigQuery is more than a data warehouse—it's an autonomous data-to-AI platform. Use familiar SQL to train ML models, run time-series forecasts, and generate AI-powered insights with native Gemini integration. Built-in agents handle data engineering and data science workflows automatically. Get $300 in free credit, query 1 TB, and store 10 GB free monthly.
    Try BigQuery Free
  • MongoDB Atlas runs apps anywhere Icon
    MongoDB Atlas runs apps anywhere

    Deploy in 115+ regions with the modern database for every enterprise.

    MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
    Start Free
  • 1
    InferOpt.jl

    InferOpt.jl

    Combinatorial optimization layers for machine learning pipelines

    InferOpt.jl is a toolbox for using combinatorial optimization algorithms within machine learning pipelines. It allows you to create differentiable layers from optimization oracles that do not have meaningful derivatives. Typical examples include mixed integer linear programs or graph algorithms.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    NLPModels.jl

    NLPModels.jl

    Data Structures for Optimization Models

    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.
    Downloads: 2 This Week
    Last Update:
    See Project
  • 3
    DiffOpt.jl

    DiffOpt.jl

    Differentiating convex optimization programs w.r.t. program parameters

    DiffOpt.jl is a package for differentiating convex optimization programs (JuMP.jl or MathOptInterface.jl models) with respect to program parameters. Note that this package does not contain any solver. This package has two major backends, available via the reverse_differentiate! and forward_differentiate! methods, to differentiate models (quadratic or conic) with optimal solutions. Differentiable optimization is a promising field of convex optimization and has many potential applications in...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    Tulip.jl

    Tulip.jl

    Interior-point solver in pure Julia

    Tulip is an open-source interior-point solver for linear optimization, written in pure Julia. It implements the homogeneous primal-dual interior-point algorithm with multiple centrality corrections and therefore handles unbounded and infeasible problems. Tulip’s main feature is that its algorithmic framework is disentangled from linear algebra implementations. This allows to seamless integration of specialized routines for structured problems.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Run Any Workload on Compute Engine VMs Icon
    Run Any Workload on Compute Engine VMs

    From dev environments to AI training, choose preset or custom VMs with 1–96 vCPUs and industry-leading 99.95% uptime SLA.

    Compute Engine delivers high-performance virtual machines for web apps, databases, containers, and AI workloads. Choose from general-purpose, compute-optimized, or GPU/TPU-accelerated machine types—or build custom VMs to match your exact specs. With live migration and automatic failover, your workloads stay online. New customers get $300 in free credits.
    Try Compute Engine
  • 5
    Convex.jl

    Convex.jl

    A Julia package for disciplined convex programming

    Convex.jl is a Julia package for Disciplined Convex Programming (DCP). Convex.jl makes it easy to describe optimization problems in a natural, mathematical syntax, and to solve those problems using a variety of different (commercial and open-source) solvers. Convex.jl works by transforming the problem—which possibly has nonsmooth, nonlinear constructions like the nuclear norm, the log determinant, and so forth—into a linear optimization problem subject to conic constraints. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6
    JuMP

    JuMP

    Modeling language for Mathematical 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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    Surrogates.jl

    Surrogates.jl

    Surrogate modeling and optimization for scientific machine learning

    A surrogate model is an approximation method that mimics the behavior of a computationally expensive simulation. In more mathematical terms: suppose we are attempting to optimize a function f(p), but each calculation of f is very expensive. It may be the case we need to solve a PDE for each point or use advanced numerical linear algebra machinery, which is usually costly. The idea is then to develop a surrogate model g which approximates f by training on previous data collected from...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8
    FrankWolfe.jl

    FrankWolfe.jl

    Julia implementation for various Frank-Wolfe and Conditional Gradient

    This package is a toolbox for Frank-Wolfe and conditional gradient algorithms. Frank-Wolfe algorithms were designed to solve optimization problems where f is a differentiable convex function and C is a convex and compact set. They are especially useful when we know how to optimize a linear function over C in an efficient way.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 9
    JUDI.jl

    JUDI.jl

    Julia Devito inversion

    JUDI is a framework for large-scale seismic modeling and inversion and is designed to enable rapid translations of algorithms to fast and efficient code that scales to industry-size 3D problems. The focus of the package lies on seismic modeling as well as PDE-constrained optimization such as full-waveform inversion (FWI) and imaging (LS-RTM). Wave equations in JUDI are solved with Devito, a Python domain-specific language for automated finite-difference (FD) computations. JUDI's modeling operators can also be used as layers in (convolutional) neural networks to implement physics-augmented deep learning algorithms thanks to its implementation of ChainRules's rrule for the linear operators representing the discre wave equation.
    Downloads: 5 This Week
    Last Update:
    See Project
  • Build AI Apps with Gemini 3 on Vertex AI Icon
    Build AI Apps with Gemini 3 on Vertex AI

    Access Google’s most capable multimodal models. Train, test, and deploy AI with 200+ foundation models on one platform.

    Vertex AI gives developers access to Gemini 3—Google’s most advanced reasoning and coding model—plus 200+ foundation models including Claude, Llama, and Gemma. Build generative AI apps with Vertex AI Studio, customize with fine-tuning, and deploy to production with enterprise-grade MLOps. New customers get $300 in free credits.
    Try Vertex AI Free
  • Previous
  • You're on page 1
  • Next
MongoDB Logo MongoDB