如何求解如下优化问题

smileqq

$ h# I, c& W* bf=min(abs(0.5*ay_tp1)+abs(0.5*ay_tp2));
  B7 W1 k& q+ L7 A! Vs.t.
0<p<10,-10<q<0,q^2-4*p<=0;2*pi/(4*p-q^2)^(1/2)-tf=0;
%%其中：
& L+ _0 _- ~$ u# Bw=3.75;
9 z; {/ [& ?( i0 n, G' p" }- h) n; ctf=5;
tp1=0;
tp2=2*(pi-atan(q*(4*p-q^2)^(1/2)/(q^2-4*p)))/((4*p-q^2)^(1/2));
  K5 d: h  N2 C! IA1=(4*p/(4*p-q^2))^(1/2);
A2=((4*p-q^2)/2)^(1/2);
A3=q/((4*p-q^2)^(1/2));

- @& p1 a6 P; J- r! C# k% say_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)));
ay_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)));
. t3 }/ v% g. F8 l) [! f使用fmincon函数求解时显示 相邻两次迭代点的变化小于预先给定的容忍度。
求助大佬。感谢

SsaaM7

路过，帮顶一下

ExxNEN

看不懂啊，有心无力哦

haidaowang

下面结果参考下：
Objective Function (Min.): 1.28973902645915E-5
+ d; c# r) R4 Z! T" j& ip: 0.394784176495481
q: -4.3001505065871E-5

' |) ~; R6 g, u9 `# Q) p4 }5 f  UConstrained Functions:
" c' B( z; ~: M$ @2 E1: q^2-4*p-0 = -1.5791367041328
0 ~! M  i* G$ p" P- P2: 2*pi/(4*p-q^2)^(1/2)-5-0 = 6.57038867757365E-11