diff --git a/main.tex b/main.tex
index ee2a3dd0675e9c77045c7c1bdada647567309439..d5513c9242482dc6d09eb38d9dd4285921832a7f 100755
--- a/main.tex
+++ b/main.tex
@@ -171,7 +171,7 @@ grestore
%
\begin{document}
-\title{Solving Equations with Inherent Uncertainty\thanks{The research
+\title{Solving Equations and Optimization Problems with Uncertainty\thanks{The research
leading to these results has received funding from Austrian Science Fund (FWF): M 1980 and
from the Czech Science Foundation (GACR) grant number 15-14484S with institutional support RVO:67985807.}
}
@@ -748,7 +748,7 @@ If we include, in the coboundary matrix, only columns corresponding to $(n-1)$-s
order the rows ($n$-simplices) by the $u$-filtration, and then
perform a column matrix reduction such that, after the reduction, the lowest nonzero element in each column is the last nonzero element in that row,
then the desired $\beta$ is the filtration value corresponding to the row of the lowest nonzero element on the right hand side after the reduction.},
-we compute the smallest $\beta$ such that $f'|_{A_{r}\cap u_\beta}$ is not extendable: by Section~\ref{sec:algorithm-oracle}
+we compute the largest $\beta$ such that $f'|_{A_{r}\cap u_\beta}$ is not extendable: by Section~\ref{sec:algorithm-oracle}
the robustness of zero of $f$ on $u_{\beta}$ is at least $r-\alpha>0$ and
\begin{equation*}
\beta \leq \inf_{\|g-f\|\leq r-\alpha} \,\,\max_{x\in g^{-1}(0)} u(x)\leq \max_{x\in f^{-1}(0)} \, u(x).