Enhanced Random Search Optimization

Description:Two variations of a routine for random search optimizations, with lower and upper bounds specified for each variable. When each improved optimum point is found, the program performs a secondary (a.k.a. 'local') random search in the region around the improved optimum point. After half of the number of iterations are performed, the program narrows the search region around the current best point. The second variation makes sure that the reduced bounds do not cross the original bounds. Use this new version if crossing the initial bounds is prohibited by the nature of the problem you are dealing with. Otherwise, you can use either version of the program.
Current version:2.0
Author:Namir Shammas
Downloaded file size:7,746 bytes
Size on calculator:6-12 KB
User rating:Not yet rated (you must be logged in to vote)
Primary category:Math
File date:2024-01-18 08:03:04
Creation date:2024-01-18
Source code:Included
Download count:12
Version history:2024-06-08: Added to site
Archive contents:
  Length      Date    Time    Name
---------  ---------- -----   ----
     5532  2024-01-15 07:49   RANDOMSEARCH.hpprgm
    11006  2024-01-15 07:49   RandomSearch.html
     6414  2024-01-18 09:03   RANDOMSEARCH2.hpprgm
    12748  2024-01-18 09:03   RandomSearch2.html
---------                     -------
    35700                     4 files
User comments:

No comments at this time.

You must be logged in to add your own comment.

Part of the HP Calculator Archive,
Copyright 1997-2024 Eric Rechlin.