Skip to main navigation
Skip to search
Skip to main content
Lingnan Scholars Home
Help & FAQ
Home
Researcher Profiles
Departments / Units
Research Outputs
Projects / Grants
Research Activities
Impacts
Prizes
Press/Media
Datasets
Student theses
Facilities / Equipments
Search by expertise, name or affiliation
A competitive divide-and-conquer algorithm for unconstrained large-scale black-box optimization
Mei YI
, Li XIAODONG
,
Yao XIN
, Mohammad Nabi OMIDVAR
Research output
:
Journal Publications
›
Journal Article (refereed)
›
peer-review
184
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A competitive divide-and-conquer algorithm for unconstrained large-scale black-box optimization'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Computer Science
Decision Variable
100%
Evolution Strategy
100%
Covariance Matrix
100%
Divide-and-Conquer Algorithm
100%
Objective Function
66%
Algorithms
66%
Experimental Result
33%
Optimization Problem
33%
Benchmark Function
33%
Global Optimization
33%
Identification
33%
Functions
33%
Black-Box Problem
33%
Models
33%