刚接触优化算法，在用Python时调用二次规划包cvxopt遇到如下问题

刚接触优化算法，这两天在用二次规划求解问题的时候总是报这个错误，有知道是什么问题吗？该怎样解决呢?

用代码块功能插入代码，请勿粘贴截图

运行结果及报错内容

Traceback (most recent call last):
  File "C:\Users\lenovo\AppData\Roaming\Python\Python39\site-packages\cvxopt\misc.py", line 1429, in factor
    lapack.potrf(F['S']) 
ArithmeticError: 371

During handling of the above exception, another exception occurred:

Traceback (most recent call last):
  File "C:\Users\lenovo\AppData\Roaming\Python\Python39\site-packages\cvxopt\coneprog.py", line 2065, in coneqp
    try: f = kktsolver(W)
  File "C:\Users\lenovo\AppData\Roaming\Python\Python39\site-packages\cvxopt\coneprog.py", line 1981, in kktsolver
    return factor(W, P)
  File "C:\Users\lenovo\AppData\Roaming\Python\Python39\site-packages\cvxopt\misc.py", line 1444, in factor
    lapack.potrf(F['S']) 
ArithmeticError: 371

During handling of the above exception, another exception occurred:

Traceback (most recent call last):
  File "E:\jianmo\GA\GA.py", line 87, in <module>
    coef = SVR(1000, 0.01)
  File "E:\jianmo\GA\GA.py", line 71, in SVR
    res = solvers.qp(P, q, G, h)
  File "C:\Users\lenovo\AppData\Roaming\Python\Python39\site-packages\cvxopt\coneprog.py", line 4485, in qp
    return coneqp(P, q, G, h, None, A,  b, initvals, kktsolver = kktsolver, options = options)
  File "C:\Users\lenovo\AppData\Roaming\Python\Python39\site-packages\cvxopt\coneprog.py", line 2067, in coneqp
    raise ValueError("Rank(A) < p or Rank([P; A; G]) < n")
ValueError: Rank(A) < p or Rank([P; A; G]) < n

ValueError: Rank(A) < p or Rank([P; A; G]) < n
值错误：等级（A）<p或等级（[p；A；G]）<n

• 建议你看下这篇博客👉 ：《Python进阶系列》二十三：解决线性规划和二次型规划问题的CVXOPT模块

提示很明显，看日志可知道

File "E:\jianmo\GA\GA.py", line 71, in SVR
    res = solvers.qp(P, q, G, h)

很明显，你的数据在某个条件下是有问题从而导致报错。

参考