scipy.optimize注意constraints

最新推荐文章于 2024-01-18 22:58:43 发布

u_7890

最新推荐文章于 2024-01-18 22:58:43 发布

阅读量1.9k

点赞数 1

分类专栏： python

本文链接：https://blog.csdn.net/u_7890/article/details/104502104

版权

python 专栏收录该内容

57 篇文章 2 订阅

订阅专栏

求解带有等式约束的最优化问题，遇到了

Optimization terminated successfully. (Exit mode 0)

参考了问题https://stackoverflow.com/questions/37791680/scipy-optimize-minimize-slsqp-with-linear-constraints-fails，找到了原因是constraints写得有误。例子如下

import numpy as np
from scipy.optimize import minimize

# problem dimensions:
n = 10 # arbitrary integer set by user
m = 2 * n

# generate parameters A, b:
np.random.seed(123) # for reproducibility of results
A = np.random.randn(m,n)
b = np.random.randn(m)
z0 = np.random.randn(n+m)
# objective function:
def obj(z):
    vy = z[n:]
    return 0.5 * vy.dot(vy)

def cons_i(z, i):
    vx = z[:n]
    vy = z[n:]
    return A[i].dot(vx) - b[i] - vy[i]

# listable of scalar-output constraints input for SLSQP:
cons_per_i_one = [{'type':'eq', 'fun': lambda z: cons_i(z, i)} for i in np.arange(m)]  #这种就不行
cons_per_i = [{'type':'eq', 'fun': cons_i, 'args': (i,)} for i in np.arange(m)]  # 下面这种就可以

sol2 = minimize(obj, x0 = z0, constraints = cons_per_i, method = 'SLSQP', options={'disp': True})

还没具体看为什么会有这个问题，但把这里bug记录下