OOQP二次优化库

优化理论及应用相关教程及博客请关注专栏：
https://blog.csdn.net/qq_35635374/article/details/138507747

NAME
OOQP - A package for solving convex quadratic programming problems.

SYNOPSIS
This directory contains OOQP, a package for solving convex quadratic
programming problems (QP). These are optimization problems in which the
objective function is a convex quadratic function and the constraints
are linear functions of a vector of real variables. They have the
following general form:

    minimize (1/2) * x' * Q * x + c' * x
    subject to                     A * x  = b
                                   C * x >= d

where Q is a symmetric positive semidefinite n by n matrix, x is a
n-vector of variables, A and C are matrices of dimensions m_a by n and
m_c by n, respectively, and c, b, and d are vectors of appropriate
dimensions.

Man