python 二次规划_仅依赖于NumPy/SciPy的二次规划（QP）解算器？

我不太熟悉二次规划，但我认为您可以使用scipy.optimize的约束最小化算法来解决这类问题。下面是一个例子：import numpy as np

from scipy import optimize

from matplotlib import pyplot as plt

from mpl_toolkits.mplot3d.axes3d import Axes3D

# minimize

# F = x[1]^2 + 4x[2]^2 -32x[2] + 64

# subject to:

# x[1] + x[2] <= 7

# -x[1] + 2x[2] <= 4

# x[1] >= 0

# x[2] >= 0

# x[2] <= 4

# in matrix notation:

# F = (1/2)*x.T*H*x + c*x + c0

# subject to:

# Ax <= b

# where:

# H = [[2, 0],

# [0, 8]]

# c = [0, -32]

# c0 = 64

# A = [[ 1, 1],

# [-1, 2],

# [-1, 0],

# [0, -1],

# [0, 1]]

# b = [7,4,0,0,4]

H = np.array([[2., 0.],

[0., 8.]])

c = np.array([0,