如何求解如下优化问题

smileqq

% [) X7 A$ e. \% h- Nf=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;
9 J- C& o2 B6 X2 r1 {8 W%%其中：
6 K' [; Q6 a, kw=3.75;
$ H. Z  ?' n$ o3 ]; v" e! Q" Vtf=5;
tp1=0;
( Z  G, T7 d3 f( `( `tp2=2*(pi-atan(q*(4*p-q^2)^(1/2)/(q^2-4*p)))/((4*p-q^2)^(1/2));
( ]6 Y. X: |0 H7 rA1=(4*p/(4*p-q^2))^(1/2);
% T1 a' {2 J! A! R+ }A2=((4*p-q^2)/2)^(1/2);
A3=q/((4*p-q^2)^(1/2));
" u  d# T7 y8 M0 G# @
- C$ G; Q- I; o# E! T& a: xay_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)));
. C' b/ p: ^; t' S# Day_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

下面结果参考下：
Objective Function (Min.): 1.28973902645915E-5
p: 0.394784176495481
q: -4.3001505065871E-5

# ^$ c9 X3 T! r* S6 Y; F% l8 v5 V/ qConstrained Functions:
' _" |7 a+ [% h1: q^2-4*p-0 = -1.5791367041328
2: 2*pi/(4*p-q^2)^(1/2)-5-0 = 6.57038867757365E-11