o 3Zg9@s>dgfddZddZddZddZdd d d gfd d ZdS)Nc Csdd|D}|}d}d} tt|D]a} t|| || || d|| d|| <||g|R}| d7} ||kr>|}q||  || <t|| || || d|| d|| <||g|R}| d7} ||krn|}q|| || <qtt|D]} || || <q{|| fS)a ## given a point, look for a better one nearby one coord at a time f is a function that takes a list of floats (of the same length as point) as an input args is a dict of any additional arguments to pass to f delta, and point are same-length lists of floats prevbest is a float point and delta are both modified by the function cSg|]}|qSr.0xrrK/home/webroot/ce-5319-webroot/MLBE4CE/chapters/optimization/hookeNjeeves.py z&_hooke_best_nearby..)rangelen_value_in_bounds) fdeltapointprevbestboundsargszminfftmpfevirrr_hooke_best_nearbys( ,,rcCs`tt|D]'}||||dkr||d||<q||||dkr-||d||<qdS)z? shifts the point so it is within the given bounds r r Nr r )rrrrrr_point_in_boundssrcCsLd}tt|D]}||||dkrd}q||||dkr#d}q|S)z< true if the point is in the bounds, else false Tr Fr r)rroutrrrr_is_point_in_boundssrcCs||kr|S||kr tS|SN)hight)vallowhighrrrrs r?gư>ic st}d|d<d|d<dgt|}dgt|} |dur%dd|D}ndd|D}d d|D}d} d } d } |D],} | d durJtd | d <nt| d | d <| d dur_td | d <q;t| d | d <q;zz0t||dd|D}dd|D}tt|D]}t||||<||dkr||<q}||g|R}| d 7} |}|} | |kr||kr| d 7} dd|D}t||||||\}}| |7} d }||krj|d krj|} tt|D]>}||||krt|| ||<nt||||<||}||||<t|||||||d ||d ||<q|}t||||||\}}| |7} ||kr.cSsg|] }|d|dgqS)r r rrrrrrscSrrrrrrrrrr z-infr infcSrrrrrrrr rcSrrrrrrrr rcSrrrrrrrr"rr$csg|]}|qSrrrrhorrrHr'Fz. line number: nitfevalsfunr) dictr floatrr absrr Exceptionsysexc_infostr tb_lineno)rstartptrr*epsilonitermaxrresultrendptfminnfevitersboundxbeforenewxr steplengthfbeforenewfevalskeeptmpreexc_typeexc_objexc_tbrr)rhookes      2 &0& rK)rrrrrKrrrrs +