Talk:Test functions for optimization

This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Mathematics Low‑priority This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics Low This article has been rated as Low-priority on the project's priority scale.

The formula given differs from the cited reference[20]. Function 2 should have the term sin^3(x) or (sin(x))^3 instead of sin(x^3). Please correct it.

The reference says to constrain inside the curve defined by:

t = chebfun('t',[0,2*pi]);
x = 2*sin(t); y = 2*cos(t)-(1/2)*cos(2*t)-(1/4)*cos(3*t)-(1/8)*cos(4*t);

If you plug in t = 1, you get a point at (1.68, 1.62). Wikipedia's version says:

t = Atan2(y/x)

If you plug in x = 1.68, y = 1.62, you get t = 0.766, which does not match the original t. So I think this is incorrect. — Omegatron (talk) 05:00, 7 September 2017 (UTC)Reply

• The plot provided is for the constrains as stated. I added the note "(modified)" after the function name, and removed the "dubious" flag. Pasimi (talk) 23:32, 9 December 2017 (UTC)Reply

The quadrant resolved atan2(arg1,arg2) function is ambiguous in terms of the order (e.g. is it FORTRAN-like or Excel)?
Consider resolving by ''t'' = Atan2(arg1,arg2) by explicitly stating the underlying ratios.

Continuous Global Optimization in R https://www.jstatsoft.org/article/view/v060i06 Katharine M. Mullen 2014

Includes: Ackley’s problem Aluffi-Pentini’s problem Becker and Lago problem Bohachevsky 1 problem Bohachevsky 2 problem Branin problem Camel back three hump problem Camel back six hump problem Cosine mixture problem Cosine mixture problem, n = 4 Dekkers and Aarts problem Easom problem Epistatic Michalewicz problem Exponential problem Goldstein and Price problem Griewank problem Gulf research problem Hartman 3 problem Hartman 6 problem Hosaki problem Kowalik problem Levy and Montalvo 1 problem Levy and Montalvo 2 problem Levy and Montalvo 2 problem, n = 10 McCormick problem Meyer and Roth problem Miele and Cantrell problem Modified Langerman problem Modified Rosenbrock problem Multi-Gaussian problem Neumaier 2 problem Neumaier 3 problem Paviani’s problem Periodic problem Powell’s quadratic problem Price’s transistor modelling problem Rastrigin problem Rosenbrock problem Salomon problem Schaffer 1 problem Schaffer 2 problem Shubert problem Schwefel problem Shekel 5 problem Shekel 7 problem Shekel 10 problem Shekel’s foxholes problem Shekel’s foxholes problem, n = 10 Wood’s problem Sinusoidal problem Sinusoidal problem, n = 20

Package: https://cran.r-project.org/web/packages/globalOptTests/index.html — Preceding unsigned comment added by 66.35.36.132 (talk) 00:07, 26 July 2020 (UTC)Reply

I recommend that this Wiki page lists only test functions if they are cited with the seminal source, which should be a permanently accessible reference, e.g. journal paper or Zenodo. A good example is H.H. Rosenbrock "An automatic method for finding the greatest or least value of a function" The Computer J. 1960. This will enable double-checking. For example function 'Booth' has no cited source, and is thus eligible to be removed. — Preceding unsigned comment added by Peter.schild (talk • contribs) 16:55, 5 September 2022 (UTC)Reply

Deb K. (2011) Software for multi-objective NSGA-II code in C. Available at URL: https://www.iitk.ac.in/kangal/codes.shtml Dbague (talk) 00:41, 26 July 2024 (UTC)Reply

MrOllie Before making large deletions that have been in place for decades, please consider proposing the changes on the article's talk page. — Preceding unsigned comment added by 128.46.161.197 (talk) 22:10, 18 February 2025 (UTC)Reply

They weren't in place for decades, and they were added by someone who was evading a block. We can do without their selfpromotional spam. MrOllie (talk) 22:43, 24 February 2025 (UTC)Reply