My problem is how to find the best decreasing 3rd degree polynomial regression in R. I have data, lets say

x <- x <- c(1:5, 17, 23, 30, 35, 36)
x <- x/max(x)
y <- c(600, 555, 400, 333, 332, 331, 330, 214, 210, 190)

Here I want to find best polynomial fitting these points, with a constraint, that polynomial must be in whole interval decreasing (here the is interval from 0 to 1). When I use simple lm

m <- lm(y ~ I(x^3) +I(x^2) + x)

the polynomial is not strictly decreasing.

Simple math: I want to find a polynomial $$ y = ax^3 + bx^2 +cx + d $$

This polynomial is decreasing when

$$ dy / dx < 0 $$,

which means

$$ 3ax^2 + 2bx + c < 0 $$.

From here I can find the constraints, that are

  1. $ a < (-2bx - c)/3x^2 $,
  2. $ b < (-3x^2 - c)/2x $,
  3. $ c < -3ax^2 - 2bx $.

Is there any way how to input these constraints into lm ?

PS: I found this link with similar question, but my problem is little more complex. Hope somebody can help!

EDIT: I tested the current answer on this new data set and it doesn't work, why?

x1 <- c(0.01041667, 0.30208333, 0.61458333, 0.65625000, 0.83333333)
y1 <- c(772, 607, 576, 567, 550)
  • $\begingroup$ Constraints are expressed in the wrong way. It's better to observe that $dy/dx$ is a quadratic polynomial with real coefficients, which is negative $\forall x$ if it is negative for at least one value of x, for example 0 ( which leads to the constraint $c <0$) and if it doesn't have real roots, i.e the discriminant $\Delta=4b^2-12ac$ is $<0$. $\endgroup$
    – DeltaIV
    Jun 25, 2016 at 18:25
  • $\begingroup$ @DeltaV "which is negative ∀x if it is negative for at least one value of x, for example 0" Huh ? What about $x^2 -1 $ . While your discriminant forumula isn't 'wrong', it is the same as the far more familiar $b^2-4ac$. $\endgroup$
    – meh
    Jun 27, 2016 at 13:15
  • $\begingroup$ @aginensky you missed the "and" part: negative for at least one value of x AND having discriminant < 0. $x^2-1$ is obviously not a good example because it's negative for a value of x (x=0), but the discriminant is not negative. $\endgroup$
    – DeltaIV
    Jun 27, 2016 at 13:48
  • $\begingroup$ concerning the discriminant formula, we are interested in the discriminant of the polynomial $3ax2+2bx+c$. This is $\Delta=4b^2-12ac$ which upon semplification reduces to $b^2-3ac$, not $b^2-4ac$. You're missing the fact that the coefficients of the polynomial we are interested in are $3a, 2b, c$, not $a,b,c$. Anyway, this is not a fruitful line of work. See my answer for a better approach. $\endgroup$
    – DeltaIV
    Jun 27, 2016 at 13:52
  • $\begingroup$ @DeltaIV - indeed I did miss the 'and'. And your right is it $b^2 - 3ac$ , that is a typo on my part. $\endgroup$
    – meh
    Jun 28, 2016 at 3:47

1 Answer 1


First of all, let's write the unconstrained model so that the coefficients are consistently ordered (in this case, from lowest to highest degree):

unconstrained_model <- lm(y ~ x + I(x^2) +I(x^3))

Secondly, constrained least square regression always has higher RMSE on the data sample than unconstrained least square, unless the latter satisfies the constraints, in which case the two solutions are the same. In practice, if the data don't respect the constraints very well, the constrained fit can be quite bad.

In your case the data are decreasing, which is good. But you also have 4 data points where the ordinate is nearly constant (with respect to the range of y, $I_y =[\min(y),\max(y)]$), even if the corresponding variation in x is considerable, with respect to $I_x = [\min(x),\max(x)]$.In other words, you have a large plateau in the center of your sample:

df <- data.frame(x,y)
(p <- ggplot(data=df,aes(x=x,y=y)) + geom_line()+geom_point()+geom_smooth())

enter image description here

This is not a pattern which can be easily fit by a monotone decreasing third degree polynomial.

Having said that, let's solve the constrained regression problem. First of all let's get explicit equations for the constraints in terms of of the model coefficients. You already noted that the third degree polynomial is decreasing in $I=[0,1]$ if and only if

$$3ax^2+2bx+c <0 \quad \forall x \in I $$

Note that $d$ doesn't appear in this inequality, and the reason is obvious -whether our model (the third degree polynomial) is increasing or not, doesn't depend on the value of the intercept. Since $3ax^2+2bx+c$ must be negative in 0, we get one of the constraints as $c<0$. Now, to get the other constraint inequalities, we just need to make the substitutions

$$ t_1=x,\quad t_2=x^2$$

and note that

$$x\in[0,1]\Rightarrow(t_1,t_2)\in [0,1]\times [0,1]$$

We are then led to the simpler problem of imposing a negativity constraint on a linear (degree one) polynomial in two variables:

$$f(t_1,t_2)=3at_2+2bt_1+c <0 \quad \forall (t_1,t_2) \in [0,1]\times[0,1] $$

$f$ is linear and its domain, the unit square $[0,1]^2$, is convex. Then if $f$ is positive in the four corners $(0,0)$, $(0,1)$, $(1,0)$, $(1,1)$, it is positive everywhere in $[0,1]^2$. Actually, the only possible values for $(t_1,t_2)$ are those in the lower-right half of the square (the triangle with corners $(0,0)$, $(0,1)$, $(1,1)$), because

$$x \in [0,1] \Rightarrow x^2 \le x \Leftrightarrow t_2 \le t_1 $$

Thus, we only need to impose that $f$ is negative in the three corners $(0,0)$, $(0,1)$, $(1,1)$. The negativity condition in $(0,0)$ gives again $c<0$. Imposing it also in $(1,0)$ and $(1,1)$, we finally obtain the three conditions

$$c<0,\quad3a+c <0, \quad 3a+2b+c <0$$

Perfect! Now we have three linear inequality constraints which express the condition that our model is negative in $I$. To solve a linear least square problem with equality and/or inequality constraints, R offers a package with a simple and intuitive interface, limSolve.

A <- cbind(rep(1,length(x)),x,x^2,x^3)
b <- y
G <- matrix(nrow=3,ncol=4,byrow = TRUE,data = c(0, -1,-2,-3,0,-1,-2,0,0,-1,0,0))
h <- rep(0,3)
constrained_model <- lsei(A = A, B = b, G = G, H = h, type=2)

Great, now let's get predictions for both models. lm objects have a predict method, but no equivalent method is available for the results of lsei. Thus we'll use a different approach and define a my_predict function

my_predict <- function(x,coefficients){
X <- cbind(rep(1,length(x)),x,x^2,x^3)
predictions <- X%*%coefficients


# compute predictions 
xpred <- seq(0,1,len=100)
predictions_constrained <- my_predict(xpred,constrained_model$X)
predictions_unconstrained <-    my_predict(xpred,unconstrained_model$coefficients)
df2 <- data.frame(xpred,predictions_unconstrained,predictions_constrained)

# plot results
p <- ggplot(data = df,aes(x = x, y = y,color = "data")) + 
geom_point() +
geom_line(data = df2, aes(x = xpred, y = predictions_unconstrained, color = "unconstrained fit")) +
geom_line(data = df2, aes(x = xpred, y = predictions_constrained, color = "constrained fit"))

enter image description here

As expected, the constrained fit is considerably worse than the unconstrained one. We can also compute the $R^2$, and get the same picture:

SS <-sum((y-mean(y))^2)
RSS_unconstrained <- sum((unconstrained_model$residuals)^2)
RSS_constrained <- sum((A%*%constrained_model$X-y)^2)
R2_constrained <- 1-RSS_constrained/SS
R2_unconstrained <- 1-RSS_unconstrained/SS

The constrained model explains only about 70% of the total variation, while the unconstrained model explains about 83% of the total variation. As a final note, the fact that the fit is worse on the sample data doesn't necessarily mean that the constrained model is worse than the unconstrained one, in terms of predictive accuracy. If, for example, the ideal model obeys the constraints, it may be that the constrained model has lower test error on unseen data.

Concerning the new set of data:

x <- c(0.01041667, 0.30208333, 0.61458333, 0.65625000, 0.83333333)
y <- c(772, 607, 576, 567, 550)

Repeating exactly the same calculations leads to a constrained model having the highest degree term equal to zero:

> constrained_model
 759.8756 -449.1166  224.5583    0.0000 

[1] 0

[1] 1854.049


[1] "lsei"

This polynomial is nonincreasing on $I=[0,1]$, as required, but it has a minimum in $x=1$, thus it would start increasing for $x>1$. As a matter of fact, the derivative is $2bx+c$ (since $a=0$), which for $x=1$ becomes

> 2*constrained_model$X[3]+constrained_model$X[2]


which, given the accuracy of the computations involved, is basically 0. The fact that $x=1$ is a minimum is also evident from the plot: enter image description here


  • $\begingroup$ Thank you very much. But I figured out that this solution is not universal and I dont know why. Please see duplicate question I added (I have problem with adding a comment) here link. It doesnt work for that points. $\endgroup$
    – Robert
    Jul 4, 2016 at 17:26
  • $\begingroup$ you're right, there's a small mistake in my derivation. I'll fix it, but first, please edit your question and add the new set of data for which my (wrong) solution didn't work. I'm not going to answer your other question, since it's just a duplicate of this one. $\endgroup$
    – DeltaIV
    Jul 4, 2016 at 22:10
  • $\begingroup$ @Robert, the error is fixed and now the procedure gives the right result for both the old and the new data set. It should always work now, except of course when the constrained least square method fails (check the $IsError component of the return list from lsei). $\endgroup$
    – DeltaIV
    Jul 5, 2016 at 15:47
  • $\begingroup$ Great! Thank you very much, I was becoming crazy, and solution wasnt so hard. Thx again! $\endgroup$
    – Robert
    Jul 7, 2016 at 10:10
  • 1
    $\begingroup$ why regression with this constraints gives me different polynom, even if the uncoinstrained model is decreasing by itself? $\endgroup$
    – Robert
    Sep 30, 2016 at 21:55

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.