如何求解如下优化问题

smileqq

f=min(abs(0.5*ay_tp1)+abs(0.5*ay_tp2));
9 ?+ H8 ^# z! {% G' A/ G3 g: cs.t.
; l7 Y4 o; j$ ]0<p<10,-10<q<0,q^2-4*p<=0;2*pi/(4*p-q^2)^(1/2)-tf=0;
%%其中：
. b  v, ~' e2 Q$ k0 J5 ~w=3.75;
tf=5;
tp1=0;
tp2=2*(pi-atan(q*(4*p-q^2)^(1/2)/(q^2-4*p)))/((4*p-q^2)^(1/2));
% ]9 v4 A/ u$ f( x! |0 S3 EA1=(4*p/(4*p-q^2))^(1/2);
A2=((4*p-q^2)/2)^(1/2);
6 Y  |3 i7 e  J8 n- _! l5 n  ~! o, ^A3=q/((4*p-q^2)^(1/2));
. \# q& S3 U* r$ M! \
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)));
. x$ Z5 d0 R2 `6 g% ?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)));
使用fmincon函数求解时显示 相邻两次迭代点的变化小于预先给定的容忍度。
求助大佬。感谢

SsaaM7

路过，帮顶一下

ExxNEN

看不懂啊，有心无力哦

haidaowang

下面结果参考下：
$ x1 O9 e! z* S. x' J% \: i0 V. }+ H7 JObjective Function (Min.): 1.28973902645915E-5
% H- L/ ?) p' D5 y" S  [p: 0.394784176495481
  E! A3 h; I) C7 ?: u- G2 T8 a* sq: -4.3001505065871E-5

2 o  i" i- [3 ZConstrained Functions:
  W9 v4 @4 s) ]' `1: q^2-4*p-0 = -1.5791367041328
2: 2*pi/(4*p-q^2)^(1/2)-5-0 = 6.57038867757365E-11