Python - 用 x[0] 最小化< x[1] < x[2] constraint

Question

我正在尝试创建一个最小化程序来找到预测值 (r) 和实际值 (x) 之间的最小平方和误差。我正在拟合 b_1、b_2 和 b_3 以获得 r。我正在使用 scipy.optimize() 中的最小化函数。我已经为有效的 3 个变量中的每一个都包含了界限。我还想包括一个不支持 b_1- 运算符的约束，请改用 bitwise_xor、

^

运算符或 logical_xor 函数。 任何帮助都会很棒！

import numpy as np
import pandas as pd
import sys
import math
import numpy as np
from scipy.optimize import curve_fit
import os
from scipy.optimize import minimize

def psd_fun(c_s):
    b_1 = c_s[0]
    b_2 = c_s[1]
    b_3 = c_s[2]
    a = np.arange(-1.0, 1.01, 0.10)
    b = np.linspace(-1.0, 5.0, 40)
    c = []
    x=282.335
    p_1 = 0.109
    p_2 = 0.102
    p_3 = 0.789
    pt = 0.440

    d1=[]
    d2=[]
    d3=[]
    d12=[]
    d22=[]
    d32=[]
    for i in b:
        z=10**i
        c += [z]
    for i in c:
        d1 += [p_1*(1-math.exp(-(i/b_1)))*pt]
        d2 += [p_2 * (1 - math.exp(-(i / b_2))) * pt]
        d3 += [p_3 * (1 - math.exp(-(i / b_3))) * pt]

    for i in range(1,len(d3),1):
        d12 += [((d1[i]-d1[i-1])/(p_1*pt)*c[i])]
        d22 +=[(d2[i]-d2[i-1])/(p_2*pt)*c[i]]
        d32 +=[(d3[i]-d3[i-1])/(p_3*pt)*c[i]]

    r = sum(d12)*p_1*pt+sum(d22)*p_2*pt+sum(d32)*p_3*pt
    r1 = (r-x)**2
    return r1

cons = ({'type': 'ineq', 'fun': lambda c_s:  np.array([c_s[0] <= c_s[1]])},
        {'type': 'ineq', 'fun': lambda c_s: np.array([c_s[1] <= c_s[2]])})

bnds = ((0.1, 2.5), (15, 500), (400, 10000))
min_res = minimize(psd_fun, [2.5,276,435], bounds = bnds, constraints=cons)
print(min_res)

不使用我获得的约束：

fun: 3.3969585845074804e-15
 hess_inv: <3x3 LbfgsInvHessProduct with dtype=float64>
      jac: array([6.68100889e-09, 6.30719417e-09, 5.02965289e-08])
  message: 'CONVERGENCE: NORM_OF_PROJECTED_GRADIENT_<=_PGTOL'
     nfev: 16
      nit: 3
     njev: 4
   status: 0
  success: True
        x: array([  2.5       , 302.27943845, 638.28639494])

哪个好，我想要什么。但是我有一些程序不符合规范的数据点：b_1