Zilinskas' Function No.03

I. Mathematical Expression:

$$f(x)=\sin\left(x\right)$$

where:

\(\bullet\) \(0 \leq x \leq 20\) , \(0 \leq x \leq 50\) or \(0 \leq x \leq 100\)

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

\(\bullet\) Many global minimum happen at \(x^* = \frac{\displaystyle 3 \pi}{\displaystyle 2} + 2 \pi n\) \( \ \rightarrow \ \therefore \ \) \(2\)  for the \(1^{st}\) range, \(8\) for the \(2^{nd}\) range and \(16\) for the \(3^{rd}\) range 

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:

% Zilinskas' Function # 3 
% Ranges of initial points: 0 <= x <= 20 , 0 <= x <= 50 or 0 <= x <= 100
% Many global minimum happen at: x=(3*pi/2 + 2*pi*n) , n=0,1,2,3,...
% >> (2 for the 1st range, 8 for the 2nd range and 16 for the 3rd range) 
% f(x)=-1
% Coded by: Ali R. Alroomi | Last Update: 26 Jan. 2015 | www.al-roomi.org
clear
clc
warning off
 
xmin=0;
xmax=100;
R=100000; % steps resolution
x=xmin:(xmax-xmin)/R:xmax;
    
for i=1:length(x)
    f(i)=sin(x(i));
end
 
plot(x,f,'r','LineWidth',2);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