Home › Entities › academia › A Competitive Divide-and-Conquer Algorithm for Unconstrained Large-Scale Black-Box Optimization

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

Research article (ACM Transactions on Mathematical Software, 2016) · cited 246× · AI/ML
academia openalex:W2413634576
Press Enter · cited answer in seconds

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

Summary

A Competitive Divide-and-Conquer Algorithm for Unconstrained Large-Scale Black-Box Optimization is a scholarly article[1].

Key Facts

  • A Competitive Divide-and-Conquer Algorithm for Unconstrained Large-Scale Black-Box Optimization's instance of is recorded as scholarly article[2].

Related Entities

Xin Yao

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). A Competitive Divide-and-Conquer Algorithm for Unconstrained Large-Scale Black-Box Optimization. Retrieved May 24, 2026, from https://4ort.xyz/entity/a-competitive-divide-and-conquer-algorithm-for-unconstrained-large-scale-black-box-optimization
MLA “A Competitive Divide-and-Conquer Algorithm for Unconstrained Large-Scale Black-Box Optimization.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/a-competitive-divide-and-conquer-algorithm-for-unconstrained-large-scale-black-box-optimization.
BibTeX @misc{4ortxyz_a-competitive-divide-and-conquer-algorithm-for-unconstrained-large-scale-black-box-optimization_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{A Competitive Divide-and-Conquer Algorithm for Unconstrained Large-Scale Black-Box Optimization}}, year = {2026}, url = {https://4ort.xyz/entity/a-competitive-divide-and-conquer-algorithm-for-unconstrained-large-scale-black-box-optimization}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): A Competitive Divide-and-Conquer Algorithm for Unconstrained Large-Scale Black-Box Optimization — https://4ort.xyz/entity/a-competitive-divide-and-conquer-algorithm-for-unconstrained-large-scale-black-box-optimization (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/a-competitive-divide-and-conquer-algorithm-for-unconstrained-large-scale-black-box-optimization · Last refreshed: