With Uno, finally take full control of your SQP/barrier solver for nonlinearly constrained optimization
-
Updated
Nov 12, 2026 - C++
GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Build software better, together
#
optimization-solverHere are 7 public repositories matching this topic...With Uno, finally take full control of your SQP/barrier solver for nonlinearly constrained optimization
cpp optimization constrained-optimization optimization-methods numerical-optimization nonlinear-optimization optimization-algorithms nonlinear-programming quadratic-programming interior-point-method newton-method continuous-optimization sequential-quadratic-programming mathematical-programming mathematical-optimization nonconvex-optimization local-optimization optimization-solver
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
python optimization solver scientific-computing iterative-methods conjugate-gradient sparse-linear-solver numerical-linear-algebra matrix-algorithms preconditioned-conjugate-gradient large-scale-optimization optimization-solver senatorov preconditioned-cg python-cg-implementation iterative-solver sparse-cg-solver solver-sparse-cg
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)
python optimization modeling linear-programming pyomo cplex operations-research pulp r-programming integer-programming mixed-integer-programming stochastic-optimization non-linear-optimization optimization-modeling integer-linear-programming optimization-problem pulp-library pyomo-glpk optimization-solver pyomo-library
Modern Fortran SQP OPTimizer
fortran optimization constrained-optimization optimization-methods sqp sequential-quadratic-programming fortran-package-manager optimization-solver sqp-optimization
BOYogala's OPtimization Solver, BOYOPS, colloquially referred to as the "BOY's OPtimization Solver."
Convex, Nonsmooth, Nonlinear Optimization Solver and Problems
genetic-algorithm constrained-optimization optimization-algorithms quadratic-programming washington-state-university linesearch derivative-free-optimization nelder-mead-simplex trust-region-methods derivative-based-optimization quasi-newton-method bfgs-algorithm optimization-solver nocedal-wright-numerical-optimization
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.
python benchmarking numpy django-rest-framework swagger openapi scipy numerical-optimization hypothesis quadratic-programming convex-optimization interior-point-method mehrotra-predictor-corrector optimization-solver kkt-conditions
Add this topic to your repoTo associate your repository with the optimization-solver topic, visit your repo's landing page and select "manage topics." |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |