{"id":17116542,"url":"https://github.com/sovrasov/multievolvent-go","last_synced_at":"2025-03-24T00:52:54.529Z","repository":{"id":94255511,"uuid":"105398324","full_name":"sovrasov/multievolvent-go","owner":"sovrasov","description":"An implementation of the algorithm of global search exploiting multiple Peano-type curves","archived":false,"fork":false,"pushed_at":"2019-05-07T10:32:40.000Z","size":7110,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-01-29T07:27:21.388Z","etag":null,"topics":["cpp","global-optimization"],"latest_commit_sha":null,"homepage":null,"language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/sovrasov.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-09-30T20:19:51.000Z","updated_at":"2019-05-07T10:32:42.000Z","dependencies_parsed_at":"2023-07-27T12:16:06.690Z","dependency_job_id":null,"html_url":"https://github.com/sovrasov/multievolvent-go","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sovrasov%2Fmultievolvent-go","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sovrasov%2Fmultievolvent-go/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sovrasov%2Fmultievolvent-go/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sovrasov%2Fmultievolvent-go/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sovrasov","download_url":"https://codeload.github.com/sovrasov/multievolvent-go/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245191627,"owners_count":20575248,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["cpp","global-optimization"],"created_at":"2024-10-14T17:49:05.966Z","updated_at":"2025-03-24T00:52:54.523Z","avatar_url":"https://github.com/sovrasov.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# multievolvent-go\nAn implementation of the algorithm to solve constrained global optimizations problems exploiting multiple Peano-type curves.\nThe algorithm is described in paper R. G. Strongin [Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves][paper], Journal of Global Optimization 2(4), 1992.\n\nAlso an alternative method of generation different Peano-type curves was implemented. The method is based on rotations of the original curve. For details see paper: K. A. Barkalov, V. V. Ryabov, S. V. Sidorov [Parallel computations in global optimization problems][paper2],  2009 (in Russian)\n\n[paper]: https://rd.springer.com/article/10.1007/BF00122428\n[paper2]: https://cyberleninka.ru/article/n/parallelnye-vychisleniya-v-zadachah-mnogoekstremalnoy-optimizatsii\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsovrasov%2Fmultievolvent-go","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsovrasov%2Fmultievolvent-go","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsovrasov%2Fmultievolvent-go/lists"}