diff --git a/src/FISTA_secondOrder.m b/src/FISTA_secondOrder.m
index 7162c415d26a4e0b1b7d3f6fdbbfbb0f4e8cf14d..95acf32e3d1cee09df38fe3844b983b468ad70cf 100644
--- a/src/FISTA_secondOrder.m
+++ b/src/FISTA_secondOrder.m
@@ -1,6 +1,6 @@
 function [F, nr_of_iterations, Res] = FISTA_secondOrder(G, sampling, kappa, P_OmegaC, z, kmax)
 
-% Solves the l1xl1 minimization problem for the splitting and/ or completion problem in Born
+% FISTA_SECONDORDER: Solves the l1xl1 minimization problem for the splitting and/ or completion problem in Born
 % approximation of order 2 numerically by using the FISTA algorithm.
 %
 % INPUT:    G           Observed far field matrix, nxhat*nd-array.
@@ -17,6 +17,8 @@ function [F, nr_of_iterations, Res] = FISTA_secondOrder(G, sampling, kappa, P_Om
 %           nr_of_iterations    Number of performed FISTA iterations.
 %           Res                 Residuum-norms for all FISTA iterations, vector of length nr_of_iterations.
 %
+% SYNTAX: FISTA_secondOrder(G, sampling, kappa, P_OmegaC, z, kmax)
+%
 % *********************************************************************************************************
 
 nr_of_sources = size(z,2);