A competitive divide-and-conquer algorithm for unconstrained large-scale black-box optimization

Y Mei, MN Omidvar, X Li, X Yao - ACM Transactions on Mathematical …, 2016 - dl.acm.org
This article proposes a competitive divide-and-conquer algorithm for solving large-scale
black-box optimization problems for which there are thousands of decision variables and the …
被引用次数：246 相关文章
[PDF] psu.edu

[PDF][PDF] Competitive Divide-and-Conquer Algorithm for Unconstrained Large Scale Black-Box Optimization

YI MEI, MN OMIDVAR, X LI, XIN YAO - Citeseer
This paper proposes a competitive divide-and-conquer algorithm for unconstrained large
scale black-box optimization, which has an unavailable algebraic model for the problem and …
[PDF] bham.ac.uk

[PDF][PDF] A competitive divide-and-conquer algorithm for unconstrained large-scale black-box optimization

Y Mei, MN Omidvar, X Li, X Yao - 2016 - pure-oai.bham.ac.uk
This paper proposes a competitive divide-and-conquer algorithm for solving large-scale
black-box optimization problems, where there are thousands of decision variables, and the …

A Competitive Divide-and-Conquer Algorithm for Unconstrained Large-Scale Black-Box Optimization

Y Mei, MN Omidvar, X Li, X Yao - ACM Transactions on Mathematical …, 2016 - cir.nii.ac.jp
抄録< jats: p> This article proposes a competitive divide-and-conquer algorithm for solving
large-scale black-box optimization problems for which there are thousands of decision …
[PDF] vuw.ac.nz

[PDF][PDF] Competitive Divide-and-Conquer Algorithm for Unconstrained Large Scale Black-Box Optimization

YI MEI, MN OMIDVAR, X LI, XIN YAO - homepages.ecs.vuw.ac.nz
This paper proposes a competitive divide-and-conquer algorithm for unconstrained large
scale black-box optimization, which has an unavailable algebraic model for the problem and …
[PDF] researchgate.net

[PDF][PDF] Competitive Divide-and-Conquer Algorithm for Unconstrained Large Scale Black-Box Optimization

YI MEI, MN OMIDVAR, X LI, XIN YAO - researchgate.net
This paper proposes a competitive divide-and-conquer algorithm for unconstrained large
scale black-box optimization, which has an unavailable algebraic model for the problem and …

A competitive divide-and-conquer algorithm for unconstrained large-scale black-box optimization

M YI, L XIAODONG, Y XIN… - ACM Transactions on …, 2016 - scholars.ln.edu.hk
This article proposes a competitive divide-and-conquer algorithm for solving large-scale
black-box optimization problems for which there are thousands of decision variables and the …
[PDF] core.ac.uk

[PDF][PDF] A Competitive Divide-and-Conquer Algorithm for Unconstrained Large-Scale Black-Box Optimization

Y Mei, MN Omidvar, X Li, X Yao - 2016 - core.ac.uk
This paper proposes a competitive divide-and-conquer algorithm for solving large-scale
black-box optimization problems, where there are thousands of decision variables, and the …
[PDF] archive.org

[PDF][PDF] A Competitive Divide-and-Conquer Algorithm for Unconstrained Large-Scale Black-Box Optimization

YI MEI, MN OMIDVAR, X LI, XIN YAO - scholar.archive.org
This paper proposes a competitive divide-and-conquer algorithm for solving large-scale
black-box optimization problems, where there are thousands of decision variables, and the …
[PDF] birmingham.ac.uk

[PDF][PDF] A competitive divide-and-conquer algorithm for unconstrained large-scale black-box optimization

Y Mei, MN Omidvar, X Li, X Yao - 2016 - research.birmingham.ac.uk
This paper proposes a competitive divide-and-conquer algorithm for solving large-scale
black-box optimization problems, where there are thousands of decision variables, and the …