Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions

  title={Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions},
  author={Matthew J. Streeter},
We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied extensively in the evolutionary computation literature. The algorithm presented uses efficient linkage discovery in conjunction with local search. Using our algorithm, the global optimum of an order-k additively separable function defined on strings of length can be found using O( ln( )2) function evaluations, a bound which is lower… CONTINUE READING
Highly Cited
This paper has 50 citations. REVIEW CITATIONS
22 Citations
12 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 22 extracted citations

51 Citations

Citations per Year
Semantic Scholar estimates that this publication has 51 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 12 references

The Design of Innovation: Lessons from and for competent genetic algorithms

  • D. E. Goldberg
  • Boston, MA: Kluwer Academic Publishers;
  • 2002
Highly Influential
3 Excerpts

Personal communication

  • A. H. Wright, R. B. Heckendorn
  • Jan.
  • 2004
1 Excerpt

Bayesian Optimization Algorithm: From Single Level to Hierarchy

  • M. Pelikan
  • Ph.D thesis, University of Illinois Urbana…
  • 2002
2 Excerpts

Learning linkage through probabilistic expression

  • G. R. Harik, D. E. Goldberg
  • Computer Methods in Applied Mechanics and…
  • 2000
1 Excerpt

NP completeness of Kauffman’s NK model, a tunable rugged fitness landscape

  • E. D. Weinberger
  • Santa Fe Institute T.R. 96-02-003.
  • 1996
1 Excerpt

Similar Papers

Loading similar papers…