math/py-quadprog

Solve a strictly convex quadratic program
Directory:
math/py-quadprog (package's history)
Package version:
py27-quadprog-0.1.6r1
Home page:
https://github.com/rmcgibbo/quadprog
License:
gnu-gpl-v2
Source archive:
https://files.pythonhosted.org/packages/24/fb/816f87f1b9648231b51012758b1d8fa3043ee1a428e3dbb64c6e6a42b6b9/quadprog-0.1.6.tar.gz
Description:
Solve a strictly convex quadratic program Minimize 1/2 x^T G x - a^T x Subject to C.T x >= b This routine uses the the Goldfarb/Idnani dual algorithm [1]. References ---------- ... [1] D. Goldfarb and A. Idnani (1983). A numerically stable dual method for solving strictly convex quadratic programs. Mathematical Programming, 27, 1-33.
Run dependencies:
libstdc++, py27-cython>=0.20.0, py27-numpy>=1, python27>=2.7<2.8
Build dependencies:
digest>=20080510, g++>=3, gcc>=3, patch>=2.0, pax, pkg_install>=20110805.9, tnftp>=20130505~ssl
General options:
debug
Produce debugging information for binary programs
c++-compiler alternatives:
g++
Use the GNU C++ compiler
clang++
Use the LLVM C++ compiler
ccache-g++
Use ccache and the GNU C++ compiler
ccache-clang++
Use ccache and the LLVM C++ compiler
c-compiler alternatives:
gcc
Use the GNU C compiler
clang
Use the LLVM C compiler
ccache-gcc
Use ccache and the GNU C compiler
ccache-clang
Use ccache and the LLVM C compiler
python alternatives:
python27
Use python-2.7
python34
Use python-3.4
python35
Use python-3.5
python36
Use python-3.6
python37
Use python-3.7
python38
Use python-3.8