search for: unconstrained

Displaying 20 results from an estimated 96 matches for "unconstrained".

2006 Jul 13
1
Extracting Phi from gls/lme
I am trying to extract into a scalar the value of Phi from the printed output of gls or lme using corAR1 correlation. ie I want the estimate of the autocorrelation. I can't see how to do this and haven't seen it anywhere in str(model.lme). I can get all the other information - fixed and random effects etc. Is there an obvious way so that I can save the brick wall some damage? TIA
2010 Dec 21
2
Congrats to the team for 0.10.0. It sounds really good in the tests I've done so far. I'm really looking forward to the 1.0 release. One question though: could you explain briefly the difference between VBR and unconstrained VBR? And, in my case, the \$64K question: is there any situation where CELT could produce more data than specified by nbCompressedBytes when encoding? Thanks much, John RIdges
2010 Mar 15
1
map2poly - map lat/long cannot be unconstrained?
Using the maptools function "map2poly" I have created a map/polylist object - a map of the Great Lakes. My goal is to passively plot additional data on this map. Unfortunately I am not able to change (distort) the relative scale of the axes for the map, and so the sample points do not line up correctly on the map. In the code below, notice that I have set the same axis ranges on
2017 Jul 18
3
Redundancy canonical analysis plot problem in 3D using VEGAN, RGL, SCATTERPLOT3D and SFSMISC
...in.data ~ Ph+TotalN+Organicmatter+Ca+K+Na+P+Cu+Mn, data=env.data) > strain.cca Call: cca(formula = strain.data ~ Ph + TotalN + Organicmatter + Ca + K + Na + P + Cu + Mn, data = env.data) Inertia Proportion Rank Total 5 1 Constrained 5 1 5 Unconstrained 0 0 0 Inertia is mean squared contingency coefficient Some constraints were aliased because they were collinear (redundant) Eigenvalues for constrained axes: CCA1 CCA2 CCA3 CCA4 CCA5 1 1 1 1 1 > plot(strain.cca) > summary (strain.cca) Call: cca(formula...
2016 Jan 22
2
fptosi undefined behaviour
...lways thought these out-of-range instructions did produce an "undef" rather than allowing fully-general undefined behaviour (otherwise we couldn't speculate them, for a start). If so, I think the code ought to be valid: %1 is *some* i16 bitpattern, which means %2 cannot be completely unconstrained and should never be equal to %0. Cheers. Tim.
2013 Jul 19
0
mgcv: Impose monotonicity constraint on single or more smooth terms
...as the sign of the first difference is correct? I am assuming that if I generate data for this purpose the dimension should be the same so the dimension of the matrices from finite differencing are the same? A couple of (perhaps quite basic) specific questions to the example code: ## Preliminary unconstrained gam fit... G <- gam(y~s(x)+s(z)+s(v,k=20),fit=FALSE) So first create G which is going to be the input to pcls() to fit the constrained model. Then fit the unconstrained version: b <- gam(G=G) (skipping this part of the example that calculates finite differences contained in Xx and Xz where...
2003 Oct 31
1
constrained nonlinear optimisation in R?
Hello. I have searched the archives but have not found anything. I need to solve a constrained optimisation problem for a nonlinear function (“maximum entropy formalism”). Specifically, Optimise: -1*SUM(p_ilog(p_i)) for a vector p_i of probabilities, conditional on a series of constraints of the form: SUM(T_i*p_i)=k_i for given values of T_i and k_i (these are constraints on
2006 Dec 03
0
[778] trunk/wxruby2: Remove broken and deprecated LayoutConstraints, update samples & docs
...nstraints are deprecated in WxWidgets and are not supported in +WxRuby. You should use "sizers":sizer.html instead to create flexible +resizeable layouts. </ins><span class="cx"> </span><del>-Constraints are initially set to have the relationship Unconstrained, -which means that their values should be calculated by looking at known constraints. - -h2. Derived from - -"Object":object.html - -h2. See also - -"Overview and examples":constraintsoverview.html, "LayoutConstraints":layoutconstraints.html, "Window#set_constrain...
2013 Dec 16
3
[LLVMdev] Float undef value propagation
...an pick any > value for the original undef, if you leave an undef behind, you can't > control what someone else might pick for it. There are floating-point > values which cannot be the result of undef + non-NaN for many values of > non-NaN, so the result of undef + non-Nan is not an unconstrained undef. This is a very good point. Does this mean that the only valid transformations of "undef + Constant" are "Constant" (by undef == 0) or "NaN" (by undef == NaN)? Or are there known easily describible subsets of Constants which allow a more general transform?...
2020 Apr 13
2
Why we don't have eternal optimizers?
...utes and not e.g. a couple of days. And my question is, why? For almost all programs, the period that starts when the program starts being developed to the day it is released is way bigger than a couple of minutes. In the meantime, a couple of modules might not have been touched for months. And an unconstrained optimizer could do its best in all this time. Given that this eternal optimizer will respect the initial semantics, one can compile a module, test it, and then let the optimizer do its best. The behavior of a module should only be faster, no need to re-test. In the meantime of course, we need to...
2008 Jan 18
1
residuals from pcaiv
Dear R users, How can I extract the residuals from a pcaiv/rda in ade4? In Vegan there is the residuals() function, giving the approximation of the original data from the unconstrained ordination Is there something similar in ade4? Nikos
2010 Dec 04
1
...x <= t using solve.QP in the quadprog package but I'm having problems with Dmat not being positive definite, which is kinda okay since I expect it to be numerically semi-definite in most cases. As far as I'm aware the problem arises because the Goldfarb and Idnani method first solves the unconstrained problem requiring a positive definite matrix. Are there any (fast) packages that allows me to do QP with (large) semidefinite matrices? Example: t <- 100 y <- signalConvNoisy[1,] D <- crossprod(H,H) d <- crossprod(H,y) A <- cbind(rep(-1, nrow(H)), diag(ncol(H))) b0 <- c(t, rep(0,...
2008 Dec 17
0
OFF topic testing for positive coeffs
Dear all, This is off-topic, however I hope someone can give me useful suggestion.. Given the regression model y = b0 + b1*x + e I am interested in testing for positive coeffs, namely H0: b0>0 AND b1>0 H1: b0,b1 unconstrained It is simple to estimate the model under H0 and H1 (there are several suggestions on the Rlist about estimation but nothing about testing..) perform a likelihood ratio test by comparing the logLik under the constrained and the unconstrained models, however I do not know how many degrees of fre...
2008 Jul 29
0
optimize simultaneously two binomials inequalities using nlm
...d Producer), similar on the example above. I found some examples to optimize equations in R and some tips, but I not be able to define the sintaxe to use with that functions. Among the functions that could be used to resolve the problem presented, I found the function optim() that it is used for unconstrained optimization and the nlm() which is used for solving nonlinear unconstrained minimization problems. May I wrong, but the nlm() function would be appropriate to solve this problem, is it right? Can I get a pointer to solve this problem using the nlm() function or where could I get some tips/exa...
2003 Feb 12
1
rpart v. lda classification.
...get started.) I then tried rpart() for comparison and was somewhat surprised when rpart() only managed to classify 14 of the 26 observations correctly. (I got the same classification using just the first 7 predictors as I did using all of the predictors.) I would have thought that rpart(), being unconstrained by a parametric model, would have a tendency to over-fit and therefore to appear to do better than lda() when the test data and training data are the same. Am I being silly, or is there something weird going on? I can give more detail on what I actually did, if anyone is interested. The data are...
2013 Dec 15
0
[LLVMdev] Float undef value propagation
...because while you can pick any value for the original undef, if you leave an undef behind, you can't control what someone else might pick for it. There are floating-point values which cannot be the result of undef + non-NaN for many values of non-NaN, so the result of undef + non-Nan is not an unconstrained undef. Dan -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20131214/57294d83/attachment.html>
2013 Dec 13
2
[LLVMdev] Float undef value propagation
On Dec 12, 2013, at 4:57 PM, Philip Reames <listmail at philipreames.com> wrote: > undef + any == NaN (since undef can be NaN) or undef + any (since undef could be zero) undef + non-NaN is still undef. The compiler is free to choose any value of the type it wishes when simplifying an undef expression. The important point is that it still has to be a value of that type. Hence,
2014 Feb 27
1
OPUS_SET_MAX_BANDWIDTH does not have expected results
...give similar results to passing an 8Khz sample rate stream, but OPUS_SET_MAX_BANDWIDTH has almost no effect with any settings. My test data has 4Khz bandwidth. I am testing the opus encoder (latest versions) with the following opus_encoder_ctl options: OPUS_SET_VBR=1, OPUS_SET_VBR_CONSTRAINT=unconstrained, OPUS_SET_COMPLEXITY=10, OPUS_APPLICATION_AUDIO, frame=60ms I compress 2 separate audio streams which only differ in the sample rate. One is 8Khz and the other is 16Khz. Both contain identical 4Khz bandwidth audio (the 16Khz file is a properly up-sampled copy of the 8Khz file). When compre...
2008 Jun 24
1
Hessian in box-constraint problem - concern OPTIM function
...th particular interest in the method L-BFGS-B, because it is a box-constraint method. I have interest in the errors estimates too. I make: s.e. <- sqrt( diag( solve( optim(...,method='L-BFGS-B', hessian=TRUE)\$hessian ))) but in help say: "Note that this is the Hessian of the unconstrained problem even if the box constraints are active." My doubts is: How to obtain a authentic hessian for a box-constraint problem? How I should make a interpretation of this result (concern the hessian) ? Is possible make some transformation or so can I considerate this result a good approxima...
2013 Dec 16
0
[LLVMdev] Float undef value propagation
...> value for the original undef, if you leave an undef behind, you can't >> control what someone else might pick for it. There are floating-point >> values which cannot be the result of undef + non-NaN for many values of >> non-NaN, so the result of undef + non-Nan is not an unconstrained undef. >> > This is a very good point. Does this mean that the only valid > transformations of "undef + Constant" are "Constant" (by undef == 0) or > "NaN" (by undef == NaN)? Or are there known easily describible subsets of > Constants which allow a...