Description: Efficient algorithm for solving a bound constrained optimization problem can be computationally efficient, accompanied by the relevant papers.
To Search:
File list (Check if you may need any files):
direct\DIRECT\An Adaptive Restart Implementation of DIRECT.pdf
......\......\circlecon.m
......\......\CONVERGENCE ANALYSIS OF THE DIRECT ALGORITHM.pdf
......\......\DIRECT optimization algorithm user guide.pdf
......\......\Direct.m
......\......\DIRECT_sample1.m
......\......\DIRECT_sample2.m
......\......\DIRECT_sample3.m
......\......\.ixon_Test_Problems\branin.m
......\......\...................\camel.m
......\......\...................\gp.m
......\......\...................\hart3.m
......\......\...................\hart6.m
......\......\...................\shekel10.m
......\......\...................\shekel5.m
......\......\...................\shekel7.m
......\......\...................\shubert.m
......\......\gp.m
......\......\gp_con.m
......\......\Release-Notes to direct.pdf
......\......\Dixon_Test_Problems
......\DIRECT
direct
Download