Skip to content
#

optimization-solver

Here are 5 public repositories matching this topic...

Uno
conjugate-gradient-sparse-cg-solver-course

The Conjugate Gradient (CG) method is an efficient iterative algorithm for solving large, sparse systems of linear equations where the matrix is symmetric and positive-definite. It finds the minimum of a quadratic function by generating conjugate search directions, ensuring convergence in at most steps for an matrix.Solver

  • Updated Mar 17, 2026
  • Jupyter Notebook

A repository dedicated to the mathematical modeling and solution of optimization problems, featuring practical examples in Stochastic Programming, Linear Programming (LP), and Mixed-Integer Linear Programming (MILP)

  • Updated Dec 10, 2024
  • Jupyter Notebook

Primal-dual interior-point solver for convex quadratic programming in Python. Mehrotra predictor-corrector, dense & sparse KKT (NumPy / SciPy SuperLU), Django REST API, reproducible benchmarks, and validation against OSQP and Clarabel.

  • Updated Sep 17, 2026
  • Python

Add this topic to your repo

To associate your repository with the optimization-solver topic, visit your repo's landing page and select "manage topics."

Learn more