From 6c55e7c039702a81dd806e1ab6cca4053f9de154 Mon Sep 17 00:00:00 2001 From: Philipp Hasper Date: Wed, 27 May 2015 07:34:27 +0200 Subject: [PATCH] Fixed doc typo --- modules/core/include/opencv2/core/optim.hpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/modules/core/include/opencv2/core/optim.hpp b/modules/core/include/opencv2/core/optim.hpp index 18e733f47b..23e2155839 100644 --- a/modules/core/include/opencv2/core/optim.hpp +++ b/modules/core/include/opencv2/core/optim.hpp @@ -276,7 +276,7 @@ column vector and \f$x\f$ is an arbitrary `n`-by-`1` column vector, which satisf Simplex algorithm is one of many algorithms that are designed to handle this sort of problems efficiently. Although it is not optimal in theoretical sense (there exist algorithms that can solve -any problem written as above in polynomial type, while simplex method degenerates to exponential +any problem written as above in polynomial time, while simplex method degenerates to exponential time for some special cases), it is well-studied, easy to implement and is shown to work well for real-life purposes.