With Uno, finally take full control of your SQP/barrier solver for nonlinearly constrained optimization
-
Updated
Mar 4, 2026 - C++
With Uno, finally take full control of your SQP/barrier solver for nonlinearly constrained optimization
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
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)
Convex, Nonsmooth, Nonlinear Optimization Solver and Problems
Add a description, image, and links to the optimization-solver topic page so that developers can more easily learn about it.
To associate your repository with the optimization-solver topic, visit your repo's landing page and select "manage topics."