如何求解如下优化问题

smileqq

" A) X; d  M" n! ]9 A) Kf=min(abs(0.5*ay_tp1)+abs(0.5*ay_tp2));
s.t.
0<p<10,-10<q<0,q^2-4*p<=0;2*pi/(4*p-q^2)^(1/2)-tf=0;
, w4 Y' x0 p6 L( \$ s9 `%%其中：
w=3.75;
tf=5;
$ R6 C  `; d  s- ltp1=0;
tp2=2*(pi-atan(q*(4*p-q^2)^(1/2)/(q^2-4*p)))/((4*p-q^2)^(1/2));
/ ]# L; a* S- ]A1=(4*p/(4*p-q^2))^(1/2);
" a! z! e: Z; z, v3 R$ iA2=((4*p-q^2)/2)^(1/2);
A3=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)));
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)));
% J# J( }; ?( @; E使用fmincon函数求解时显示 相邻两次迭代点的变化小于预先给定的容忍度。
* }0 c3 l$ i+ ~& J. K: ?4 X( w+ Z: Q求助大佬。感谢

SsaaM7

路过，帮顶一下

ExxNEN

看不懂啊，有心无力哦

haidaowang

下面结果参考下：
; w# a; A1 x$ M$ Q; Z8 `4 XObjective Function (Min.): 1.28973902645915E-5
! j2 \1 F1 i7 ?9 v+ v4 j0 B- ^: Z+ F- rp: 0.394784176495481
: {; D) b9 K: b4 V4 `1 \! Oq: -4.3001505065871E-5
. U3 ^% w$ n5 M( H  g6 W& A
Constrained Functions:
1: q^2-4*p-0 = -1.5791367041328
/ I" c) j8 Z) e" F* X/ W% [( @2: 2*pi/(4*p-q^2)^(1/2)-5-0 = 6.57038867757365E-11