Skip to content

Global optimization by multilevel coordinate search (MCS). This is a dividing rectangle (i.e., Brach and Bound) like an optimization algorithm. It is similar to the DIRECT algorithm.

Notifications You must be signed in to change notification settings

vojha-code/Multilevel-Coordinate-Search

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

16 Commits
 
 
 
 

Repository files navigation

Global optimization by multilevel coordinate search (MCS)

Global optimization by multilevel coordinate search (MCS). This is a dividing rectangle (i.e., Brach and Bound) like an optimization algorithm. It is similar to the DIRECT algorithm. Originaly the MATLAB code was Developed by Waltraud Huyer and Arnold Neumaier
Dept. of Mathematics, University of Vienna, Austria.

Main Source http://solon.cma.univie.ac.at/~neum/software/mcs/

Translated in Python by Varun Ojha

RUN

To run this programe execute from the project hierarchy

  • msc (root)
    • functions
    • gls
    • mcs_func
    • mcs.py
    • runmcs.py
$ runmcs.py

You may need to adapt path as this program was executed in spyder ide from the root.

Customized Functions

To adpat this algorithm to your own funciton

  • Update
    • TODO: implemment your funciton [functions.py]')
    • TODO: implemment your funciton papramters [defualts.py]')

About

Global optimization by multilevel coordinate search (MCS). This is a dividing rectangle (i.e., Brach and Bound) like an optimization algorithm. It is similar to the DIRECT algorithm.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages