Suharev's Function

I. Mathematical Expression:

$$f(x)=\sin\left(\frac{1}{x}\right)$$

where:

\(\bullet\) \(0 \leq x \leq 1\)

\(\bullet\) \(f_{min}(x^*)=-1\)

\(\bullet\) Many global minimum happen at \(\frac{\displaystyle 1}{\displaystyle x^*} = \frac{\displaystyle 3 \pi}{\displaystyle 2} + 2 \pi n\)

\(\bullet\) Please note that as \(x\) approaches \(0\), the term \(\left(\frac{1}{x}\right)\) becomes very large.

II. Citation Policy:

If you publish material based on databases obtained from this repository, then, in your acknowledgments, please note the assistance you received by using this repository. This will help others to obtain the same data sets and replicate your experiments. We suggest the following pseudo-APA reference format for referring to this repository:

Ali R. Al-Roomi (2015). Unconstrained Single-Objective Benchmark Functions Repository [https://www.al-roomi.org/benchmarks/unconstrained]. Halifax, Nova Scotia, Canada: Dalhousie University, Electrical and Computer Engineering.

Here is a BiBTeX citation as well:

@MISC{Al-Roomi2015,
author = {Ali R. Al-Roomi},
title = {{Unconstrained Single-Objective Benchmark Functions Repository}},
year = {2015},
address = {Halifax, Nova Scotia, Canada},
institution = {Dalhousie University, Electrical and Computer Engineering},
url = {https://www.al-roomi.org/benchmarks/unconstrained}
}

III. 2D-Plot:

IV. MATLAB M-File:

% Suharev's Function 
% Range of initial points: 0 <= x <= 1
% Many global minimum happen at: (1/x)=(3*pi/2 + 2*pi*n) , n=0,1,2,3,...
% f(x)=-1
% Coded by: Ali R. Alroomi | Last Update: 18 Jan. 2015 | www.al-roomi.org
 
clear
clc
warning off
 
xmin=0;
xmax=1;
R=100000; % steps resolution
x=xmin:(xmax-xmin)/R:xmax;
    
for i=1:length(x)
    f(i)=sin(1/x(i));
end
 
plot(x,f,'r');grid;set(gca,'FontSize',12);
xlabel('x','FontName','Times','FontSize',20,'FontAngle','italic');
ylabel('f(x)','FontName','Times','FontSize',20,'FontAngle','italic');

Click here to download m-file

V. References:

[1] E. Kiseleva and T. Stepanchuk, “On the Efficiency of a Global Non-Differentiable Optimization Algorithm Based on the Method of Optimal Set Partitioning," Journal of Global Optimization, vol. 25, no. 2, pp. 209-235, Feb. 2003.
[2] Ali R. Alroomi, "The Farm of Unconstrained Benchmark Functions," University of Bahrain, Electrical and Electronics Department, Bahrain, Oct. 2013. [Online]. Available: http://www.al-roomi.org/cv/publications