如何求解如下优化问题

smileqq

f=min(abs(0.5*ay_tp1)+abs(0.5*ay_tp2));
0 i4 Q& r. \* _7 E, @s.t.
0<p<10,-10<q<0,q^2-4*p<=0;2*pi/(4*p-q^2)^(1/2)-tf=0;
%%其中：
w=3.75;
tf=5;
tp1=0;
# C. w" A2 ~4 l2 M5 b0 y' vtp2=2*(pi-atan(q*(4*p-q^2)^(1/2)/(q^2-4*p)))/((4*p-q^2)^(1/2));
* W2 }, o8 t; U9 ?; D0 mA1=(4*p/(4*p-q^2))^(1/2);
+ J8 S" v1 H; I  F4 O" MA2=((4*p-q^2)/2)^(1/2);
' G: C4 o+ Q4 J$ ~% d2 y/ _& fA3=q/((4*p-q^2)^(1/2));
! v- D% [4 @" X" X- j
: x! U" i1 y0 W- c; B4 l; N3 Day_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)));
% M" ?* H+ t6 g$ T: ~7 q) _5 Iay_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)));
8 c8 Y7 q* L2 I( c0 E% W! `+ p4 c$ B使用fmincon函数求解时显示 相邻两次迭代点的变化小于预先给定的容忍度。
: v0 t' j0 h3 D9 L3 y" _8 a( G6 x  c求助大佬。感谢

SsaaM7

路过，帮顶一下

ExxNEN

看不懂啊，有心无力哦

haidaowang

下面结果参考下：
Objective Function (Min.): 1.28973902645915E-5
5 S+ }; b1 w0 \3 T3 k2 v! \p: 0.394784176495481
q: -4.3001505065871E-5
9 C4 c7 |; ~9 v5 Z% p9 W/ ]" }* w1 q
Constrained Functions:
1: q^2-4*p-0 = -1.5791367041328
2 {: u) v0 P1 {2 U2: 2*pi/(4*p-q^2)^(1/2)-5-0 = 6.57038867757365E-11