shengwen-tw/libqpsolver: A quadratic programming solver library written in C
github.com · 390 words · saved by 1 readers
A quadratic programming solver library written in C
A quadratic programming solver library written in C Algorithm The libqpsolver use Primal Interior Point Method to solve quadratic programming problems based on Chapter 9 to 11 of Convex Optimization by Stephen Boyd and Lieven Vandenberghe Features Support solving quadratic programming problems with or without equality, inequality, lower bound and upper bound constraints Based on Primal Interrior Point Method Support infeasible start with basic phase1 method (Not yet been fully tested) Based on Intel Math Kernel Libray (Planed to support OpenBLAS in the future) Caveats The solver is…
saved by
related reading
- Clarabel.jl/src/chordal/decomposition/psd_completion.jl at main · oxfordcontrol/Clarabel.jl · GitHubgithub.com
- bv_cvxbook.pdfweb.stanford.edu
- A Neural Network Framework for Discovering Closed-form Solutions to Quadratic Programs with Linear Constraintsarxiv.org
- bv_cvxbook.pdfstanford.edu
- Auto-research with codex: How I achieved a 232x Faster Kernel over baseline with Codex in GPU Mode's qr_v2 problemsankalp.bearblog.dev
- Mathematical optimization - Wikipediaen.wikipedia.org
- eecs127_reader.pdfeecs127.github.io
- Why Momentum Really Worksdistill.pub
- QR Decomp at the Speed of Lightml-mike.com
- 1404.5236 Sum-of-Squares Proofs and the Quest toward Optimal Algorithmsarxiv.org
- Gregory Gundersengregorygundersen.com
- QuantLib, a free/open-source library for quantitative financequantlib.org