如何求解如下优化问题

smileqq

0 m1 q2 N/ r1 @$ x& T1 U. l3 Bf=min(abs(0.5*ay_tp1)+abs(0.5*ay_tp2));
s.t.
8 Q/ v& b  L! ?5 p0<p<10,-10<q<0,q^2-4*p<=0;2*pi/(4*p-q^2)^(1/2)-tf=0;
% X6 H8 X+ V4 S# g- E%%其中：
! R6 l1 X3 d7 W+ Pw=3.75;
tf=5;
tp1=0;
: |! N7 x1 w& Z  D- r& Otp2=2*(pi-atan(q*(4*p-q^2)^(1/2)/(q^2-4*p)))/((4*p-q^2)^(1/2));
A1=(4*p/(4*p-q^2))^(1/2);
A2=((4*p-q^2)/2)^(1/2);
) ?$ c( ~( ]/ ^1 p/ A8 b$ gA3=q/((4*p-q^2)^(1/2));

ay_tp1=(w*p*exp(q*tp1/2)*A1*sin(((A2/(2^(1/2)))*tp1)+1/A3))/(1-exp(q*tf/2)*A1*sin(A2*tf-atan(A3)));
+ I) N. R# D* z+ T' ?0 way_tp2=(w*p*exp(q*tp2/2)*A1*sin(((A2/(2^(1/2)))*tp2)+1/A3))/(1-exp(q*tf/2)*A1*sin(A2*tf-atan(A3)));
7 t, A3 }3 v! R( G% h% _使用fmincon函数求解时显示 相邻两次迭代点的变化小于预先给定的容忍度。
求助大佬。感谢
4 W  K! B3 @# a' c( }- d+ b- L

haidaowang

下面结果参考下：
Objective Function (Min.): 1.28973902645915E-5
8 ^8 Z2 Q( s- K5 ^4 Jp: 0.394784176495481
q: -4.3001505065871E-5

Constrained Functions:
' O3 L6 g# O6 I9 _* p1: q^2-4*p-0 = -1.5791367041328
2: 2*pi/(4*p-q^2)^(1/2)-5-0 = 6.57038867757365E-11

ExxNEN

看不懂啊，有心无力哦

SsaaM7

路过，帮顶一下