Џkh(7 dZddlZddlmZddlmZmZm Z m Z m Z ddl m Z de de de d e d e d ef d Zdd Zdej"dej"de d e fdZy)a This module provides subroutines that ensure the returned X is optimal among all the calculated points in the sense that no other point achieves both lower function value and lower constraint violation at the same time. This module is needed only in the constrained case. Translated from Zaikun Zhang's modern-Fortran reference implementation in PRIMA. Dedicated to late Professor M. J. D. Powell FRS (1936--2015). Python translation by Nickolai Belakovski. N) DEBUGGINGEPS CONSTRMAXREALMAXFUNCMAX)presentf1c1f2c2ctolreturnc rtrttj||gtj||gzrJttj||gtj||gzrJ|dk\r|dk\sJ|dk\sJd}|xssttj||gtj||gzxr9ttj||gtj||gz }|xs ||kxr||k}|xs ||kxr||k}dt t t|dtzz}|xs8|tkxr-||kxr&|t ||kDxstj|}tr*|r ||k\r||k\rJ|s ||kr||krJ|s ||kr||krJ|S)a This function compares whether FC1 = (F1, C1) is (strictly) better than FC2 = (F2, C2), which basically means that (F1 < F2 and C1 <= C2) or (F1 <= F2 and C1 < C2). It takes care of the cases where some of these values are NaN or Inf, even though some cases should never happen due to the moderated extreme barrier. At return, BETTER = TRUE if and only if (F1, C1) is better than (F2, C2). Here, C means constraint violation, which is a nonnegative number. rF g{Gz?) ranynpisnanisposinfmaxrminrr)r r r r r is_bettercrefs ]/var/www/teggl/fontify/venv/lib/python3.12/site-packages/scipy/_lib/pyprima/common/selectx.pyisbetterrsrxxR)BKKR,AABBBrxxR)BKKR,AABBBQw27""qyy IGc"((B8"4r{{B87L"LMFVYZ\ZbZbdfhjckZloqozoz|~AC|DpE[EWFSFI3b2g2"(I3bBh227I CT6I#567 7Deb7ldrTzdrCdO?S?cWYW_W_`bWcI"(rRx88rb2g66bR2X66 c >t| r t| } nd} t|} t|} tr| dk\sJ|dk\sJdk\sJ|dk\r|| ksJ| dk\sJtj|d| k(rtj|d| k(sJtj|| k(sJtj |ddd|fj rJt tj |d|tj|d|zrJt |d|dtj |d|ztj|d|zkrJt tj |rJtj tjzrJdtj ztjzkrJt| t| k(sJt| rt tj | tj| zrJtj| d| k(rtj| d| k(sJtj | ddd|ftj| ddd|fzj rJt fdt|d||d|Ds+t tj|d|k|d|kr||||| fStjt|d||d|Dcgc]\}}t||c}}}t|| k(rtj|z d}|dkr|}nWtj|r|}n?tj|t }tj |t }|||zz }t#|}t#|||k\}t#|||k\}tj$j'|||kDj)}|dks|t|k\rd}d||<t|}tj*|d}|dd|f|ddd|f<|||d||||d|| | | dd|f| ddd|f<||dd|f<||<||<| | | | dd|f<|dz }tr)|dk\r|| ksJtj|d| k(rtj|d| k(sJtj|| k(sJtj|| k(sJtj |ddd|fj rJt tj |d|tj|d|zrJt |d|dtj |d|ztj|d|zkrJt t|d||d|Dcgc]\}}t||c}}rJt t|d||d|Dcgc]\}}t||c}}rJt| rtj| d| k(rtj| d| k(sJtj | ddd|ftj| ddd|fzj rJ||||| fScc}}wcc}}wcc}}w)a This subroutine saves X, F, and CSTRV in XFILT, FFILT, and CFILT (and CONSTR in CONFILT if they are present), unless a vector in XFILT[:, :NFILT] is better than X. If X is better than some vectors in XFILT[:, :NFILT] then these vectors will be removed. If X is not better than any of XFILT[:, :NFILT], but NFILT == MAXFILT, then we remove a column from XFILT according to the merit function PHI = FFILT + CWEIGHT * max(CFILT - CTOL, 0) N.B.: 1. Only XFILT[:, :NFILT] and FFILT[:, :NFILT] etc contains valid information, while XFILT[:, NFILT+1:MAXFILT] and FFILT[:, NFILT+1:MAXFILT] etc are not initialized yet. 2. We decide whether and X is better than another by the ISBETTER function rrNc3BK|]\}}t||yw)N)r).0ffilt_icfilt_icstrvrfs r zsavefilt..~s# q;K7GHWgq% 6 qs)nanmaskF)r lenrrsizerrrisneginfzip logical_and logical_notrsummaximumr nan_to_numrmaarrayargmaxwhere)r"rcweightr#xnfiltcfiltffiltxfiltconstrconfiltnum_constraintsnum_varsmaxfiltr r!keep cfilt_shiftedphiphimaxrfrefkworst index_to_keeps`` ` rsavefiltrGBs vf+1vH%jG1}}!||qyyzew...!||wwua H,1Bg1MMMwwu~(((HHU1fuf9-.33555rxxfu .U6E]1KKLLLuVe}q288E&5M+B'BR[[QVW]X]Q^E_'__```rxx{###HHQK"++a.011A/"++e2DDDEEv''"2222 6?288F+bkk&.AAB BB777A&/9bgggq>QU\>\ \\FUF!34r{{71fuf9CU7VV[[] ]] qsSXY_Z_S`bghninboOp qr BNN5%=A-uVe}/E FGeUE722 >>^abghninboqvw}x}q~^AJZ'SZ8AugwEA BD 4yG 54<3 a<C [[ !C**UWH-C--'2C 7]* *CS=/05$./0U%$,8??A A:3t9,FV  IEHHTN1%MQ -.E!VeV)-(E&5M-(E&5Mv1$Q %566E6 E!U(OE%LE%Lv1"5 QJEzew...wwua H,1Bg1MMMwwu~(((wwu~(((HHU1fuf9-.33555rxxfu .U6E]1KKLLLuVe}q288E&5M+B'BR[[QVW]X]Q^E_'__```[^_dekfk_lnstzuzn{[|}GWwPW'1eTB}~~~[^_dekfk_lnstzuzn{[|}GWwPWE7GTB}~~~ 7 777A&/9bgggq>QU\>\ \\FUF!34r{{71fuf9CU7VV[[] ]] %w ..UAD~}s6\ \ \ fhistchistr5c rt|}tr|dk\sJtj||k(sJt tj |tj |zrJt |dtj |ztj |zkrJ|dk\sJ|dk\sJt tj|tk|tkr t}t}nt tj|tk|tkr t}t}nFt tj|tk|tkr t}t}n t}t}t tj||k||ks|dz }nCtj||z d}tj|||k} tjtd| z}|dkr|} n9tj |r|} n!tj|t ||zz} tj| tj||k||k} tj|tj||k| | k}tj|||k}tjj|||kDj!}trO|dk\r||ksJt t#|d||d|D cgc]\} } t%| | |||||c} } rJ|Scc} } w)aS This subroutine selects X according to FHIST and CHIST, which represents (a part of) history of F and CSTRV. Normally, FHIST and CHIST are not the full history but only a filter, e.g. ffilt and CFILT generated by SAVEFILT. However, we name them as FHIST and CHIST because the [F, CSTRV] in a filter should not dominate each other, but this subroutine does NOT assume such a property. N.B.: CTOL is the tolerance of the constraint violation (CSTRV). A point is considered feasible if its constraint violation is at most CTOL. Not that CTOL is absolute, not relative. rrr&N)r(rrr)rrrr,rrrr/rrr1r2argminr+r)rHrIr5rnhistrDrkopt chist_shiftedcminrBphiminfhistichistis rselectxrTs JEzzwwu~&&&rxxU);;<<<uq288E?2R[[5GGGHHH!||qyy 2>>%'/59+< => R^^EGOUY-> ? @ R^^EGOUW_ = > r~~edlEDL9 :qy 54<3 vvmEDL12zz#qv& a<C [[ !C**UWH--0GGCBNN54<$9NOPQvvmBNN54<$OPQvveMT123uu{{5 {6==?qyTE\))gjkpqwrwkxzAGBG{HhIJUcU[]cteDk4PJK KK KJsL3 )NN)__doc__numpyr numpy.typingtypingnptconstsrrrrrr floatboolrrGNDArrayrTrrr_s ??--E-u-%-u--`K/\X3;;Xs{{XUX%Xr