OpenCV  3.3.1 Open Source Computer Vision

This class is used to perform the non-linear non-constrained minimization of a function with known gradient,. More...

#include "optim.hpp"

## Static Public Member Functions

static Ptr< ConjGradSolvercreate (const Ptr< MinProblemSolver::Function > &f=Ptr< ConjGradSolver::Function >(), TermCriteria termcrit=TermCriteria(TermCriteria::MAX_ITER+TermCriteria::EPS, 5000, 0.000001))

Static Public Member Functions inherited from cv::Algorithm
template<typename _Tp >
static Ptr< _Tp > load (const String &filename, const String &objname=String())
Loads algorithm from the file. More...

template<typename _Tp >
static Ptr< _Tp > loadFromString (const String &strModel, const String &objname=String())
Loads algorithm from a String. More...

template<typename _Tp >
static Ptr< _Tp > read (const FileNode &fn)
Reads algorithm from the file node. More...

Public Member Functions inherited from cv::MinProblemSolver
virtual Ptr< FunctiongetFunction () const =0
Getter for the optimized function. More...

virtual TermCriteria getTermCriteria () const =0
Getter for the previously set terminal criteria for this algorithm. More...

virtual double minimize (InputOutputArray x)=0
actually runs the algorithm and performs the minimization. More...

virtual void setFunction (const Ptr< Function > &f)=0
Setter for the optimized function. More...

virtual void setTermCriteria (const TermCriteria &termcrit)=0
Set terminal criteria for solver. More...

Public Member Functions inherited from cv::Algorithm
Algorithm ()

virtual ~Algorithm ()

virtual void clear ()
Clears the algorithm state. More...

virtual bool empty () const
Returns true if the Algorithm is empty (e.g. in the very beginning or after unsuccessful read. More...

virtual String getDefaultName () const

virtual void read (const FileNode &fn)
Reads algorithm parameters from a file storage. More...

virtual void save (const String &filename) const

virtual void write (FileStorage &fs) const
Stores algorithm parameters in a file storage. More...

Protected Member Functions inherited from cv::Algorithm
void writeFormat (FileStorage &fs) const

## Detailed Description

This class is used to perform the non-linear non-constrained minimization of a function with known gradient,.

defined on an n-dimensional Euclidean space, using the Nonlinear Conjugate Gradient method. The implementation was done based on the beautifully clear explanatory article [An Introduction to the Conjugate Gradient Method Without the Agonizing Pain](http://www.cs.cmu.edu/~quake-papers/painless-conjugate-gradient.pdf) by Jonathan Richard Shewchuk. The method can be seen as an adaptation of a standard Conjugate Gradient method (see, for example http://en.wikipedia.org/wiki/Conjugate_gradient_method) for numerically solving the systems of linear equations.

It should be noted, that this method, although deterministic, is rather a heuristic method and therefore may converge to a local minima, not necessary a global one. What is even more disastrous, most of its behaviour is ruled by gradient, therefore it essentially cannot distinguish between local minima and maxima. Therefore, if it starts sufficiently near to the local maximum, it may converge to it. Another obvious restriction is that it should be possible to compute the gradient of a function at any point, thus it is preferable to have analytic expression for gradient and computational burden should be born by the user.

The latter responsibility is accompilished via the getGradient method of a MinProblemSolver::Function interface (which represents function being optimized). This method takes point a point in n-dimensional space (first argument represents the array of coordinates of that point) and comput its gradient (it should be stored in the second argument as an array).

Note
class ConjGradSolver thus does not add any new methods to the basic MinProblemSolver interface.
term criteria should meet following condition:
termcrit.type == (TermCriteria::MAX_ITER + TermCriteria::EPS) && termcrit.epsilon > 0 && termcrit.maxCount > 0
// or
termcrit.type == TermCriteria::MAX_ITER) && termcrit.maxCount > 0

## § create()

 static Ptr cv::ConjGradSolver::create ( const Ptr< MinProblemSolver::Function > & f = Ptr< ConjGradSolver::Function >(), TermCriteria termcrit = TermCriteria(TermCriteria::MAX_ITER+TermCriteria::EPS, 5000, 0.000001) )
static