Ozzy

Joined 25 March 2015
4 bytes added ,  26 March 2015
Line 85: Line 85:
The algorithm would find its place in one of the existing packages (where ''optim'' or ''signal'' sound appropriate) or as a separate package. I plan to prepare two versions of the general algorithm, (temporal name {{codeline|maxent}})
The algorithm would find its place in one of the existing packages (where ''optim'' or ''signal'' sound appropriate) or as a separate package. I plan to prepare two versions of the general algorithm, (temporal name {{codeline|maxent}})
* a version for problems defined by matrix. The function's declaration should be something like this
* a version for problems defined by matrix. The function's declaration should be something like this
{{Code|Linear problem declaration|<syntaxhighlight lang="octave" style="font-size:13px">function [x,info,...]=maxent(y,D,sigma,alpha=0.95, model=1, optset)
{{Code|Matrix problem declaration|<syntaxhighlight lang="octave" style="font-size:13px">function [x,info,...]=maxent(y,D,sigma,alpha=0.95, model=1, optset)


</syntaxhighlight>}}
</syntaxhighlight>}}
Line 99: Line 99:


* another version would be defined for a non-linear function. The declaration would very similar
* another version would be defined for a non-linear function. The declaration would very similar
{{Code|Linear problem declaration|<syntaxhighlight lang="octave" style="font-size:13px">function [x,info,...]=maxent(y,fun,sigma,alpha=0.95, model=1, optset)
{{Code|Functional problem declaration|<syntaxhighlight lang="octave" style="font-size:13px">function [x,info,...]=maxent(y,fun,sigma,alpha=0.95, model=1, optset)




46

edits