similar to: Quadratic constraints

HI All, I am unable to solve a optimization Problem Please Help Me out of this to solve. The Optimization problem is as follows :- My objective function is linear and one of the constraint is quadratic. Min z = 5 * X1 + 9* X2 + 7.15 *X3 + 2 * X4 subject to X1 + X2 + X3 +X4 = 9 X1 + X4 < = 6.55 X3(X3 - 3.5) >=0 X1,X2,X3,X4 >=0 Now the problem is how to solve this kind of

Hi R, A quick question.... How can I optimize the objective function constrained to quadratic constraints? Which function of R is useful for quadratic constraints? Many Thanks, Shubha This e-mail may contain confidential and/or privileged i...{{dropped:13}}

Hi, Can I use "constrOptim" for quadratic constraints? If not, which optimizer can I go for? BR, Shubha This e-mail may contain confidential and/or privileged i...{{dropped:13}}

I was playing around with a simple example using solve.qp ( function is in the quadprog package ) and the code is below. ( I'm not even sure there if there is a reasonable solution because I made the problem up ). But, when I try to use solve.QP to solve it, I get the error that D in the quadratic function is not positive definite. This is because Dmat is zero because I don't have a

Hi, I need to maximize a quadratic function under constraints in R. For minimization I used solve.QP but for maximization it is not useful since the matrix D of the quadratic function should be positive definite hence I cannot simply change the sign. any suggestion ? thanks -- View this message in context:

Hi, Does anybody have experience to solve an quadratic programming problem with quadratic constraints in R? It seems that the package "quadprog" only handles the quadratic programming with linear constraint. My probelm is to maximze x^T\Sigma_{xy} y, subject to x^Tx=1, y^T\Sigma_{yy} y=1, and sum(y)<t, or sum(y)=t, where x and y are the variable, and the Sigma's and t are

Hi, I am using solve.QP (from quadprog) to solve a standard quadratic programming problem: min_w -0.5*w'Qw st ... I would like solve.QP to do two things: 1) to start the optimization from a user-supplied initial condition; i.e., from a vector w_0 that satisfies the constraints, and 2) to return the values of the lagrange multiplieres associated with the constraints. I did not find an obvious

Dear R Users , As a beginner in QP, I'm trying to solve a Support Vector Machine problem by a QP. In particulare I am using the quadprog package. My questions are here: 1- In the document for the package (The quadprog Package), the inequality constraint is mentioned with >= , however in a standard QP, this usaully is written with <= . This constraint should be multiplied by a

Hi, I'm quite new at R and I haven't found the answer to my question anywhere on the net, so either it is trivial or not documented. So, bare with be. I am using the quadprog package and its solve.QP routine to solve and quadratic programming problem with inconsistent constraints, which obviously doesn't work since the constraint matrix doesn't have full rank. A way to solve this

Dear R-users, in the last days I have been trying to estimate a normal linear model with equality and inequality constraints. Please find below a simple example of my problem. Of course, one could easily see that, though the constraints are consistent, there is some redundancy in the specific constraints. Nevertheless my actual applications can get much larger and I would not like to manually

I hope that someone can help me with the following question: I would like to solve the Markowitz optimization problem WITH short-sale constraints. Maybe a procedure to solve a quadratic optimization problem with convex constraints and positive variables is already implemented in R? Thank you very much, edg -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- r-help

Hi, I need to solve an optimization problem in R having linear objective function and quadratic constraints(number of variables is around 80). What are the possible choices to do this in R. optim() function only allows box constrained problems. Is it possible in nlm()? Or please tell me if there is any other routine. Thanks Amit

Hello, I have been trying to take the derivative of a quadratic B-spline obtained by using the COBS library. What I would like to do is similar to what one can do by using fit<-smooth.spline(cdf) xx<-seq(-10,10,.1) predict(fit, xx, deriv = 1) The goal is to fit the spline to data that is approximating a cumulative distribution function (e.g. in my example, cdf is a 2-column matrix with x

Dear R users, I would like to optimize a linear approximation of a quadratic function using lpSolve. My code runs without any error or warning message but the constraints that I set don't seem to work properly. Nevertheless, I am certain that my code is somewhere wrong. I would like to solve the following problem: max 2x-x^2+y subject to 2x^2 + 3y^2 <= 6 2>= x,y >= 0 I would

Hi, I'm using the package quadprog to solve the following quadratic programming problem. I want to minimize the function (b_1-b_2)^2+(b_3-b_4)^2 by the following constraints b_i, i=1,...,4: b_1+b_3=1 b_2+b_4=1 0.1<=b_1<=0.2 0.2<=b_2<=0.4 0.8<=b_3<=0.9 0.6<=b_4<=0.8 In my opinion the solution should be b_1=b_2=0.2 und b_3=b_4=0.8. Unfortunately R doesn't find

Dear Mr. Simon Wood, dear list members, I am trying to fit a similar model with gam from mgcv compared to what I did with BayesX, and have discovered the relatively new possibility of incorporating user-defined matrices for quadratic penalties on parametric terms using the "paraPen" argument. This was really a very good idea! However, I would like to constraint the coefficients

Hi all, Could anybody please point me to the solver function in R on QCQP? The quadprog package seems to be only able to handle the linear constraints... Thank you! [[alternative HTML version deleted]]

How do I calculate the confidence interval for the value x given by the intersection of two quadratics (i.e. parabolas)? I fit two quadratics of the form: y = C1 + B1*x + A1*x^2 y = C2 + B2*x + A2*x^2 to two sets of points N1 and N2. I test for whether they intersect, if they do then I calculate the roots of: 0 = (C1 - C2) + (B1 - B2)*x + (A1 - A2)*x^2 to determine where they intersect

Hi all! I have a little question concerning quadprog. To make it simple I'll start by stating the problem: I want to minimize h(d,delta)=0.5d^T B d +nabla(f(x))^T d +rho*delta^2 With respect to d\in R^n and delta \in R. I obviously have constraints (depending on both d and delta). Solve.QP does give me a good result for d but I cannot obtain anything for delta. Simce dim(Dmat)=n and

-----Original Message----- Message: 6 Date: Mon, 20 Jan 2003 01:11:24 +0100 From: Martin Michlmayr <tbm at cyrius.com> To: r-help at stat.math.ethz.ch Subject: [R] quadratic trends and changes in slopes I'd like to use linear and quadratic trend analysis in order to find out a change in slope. Basically, I need to solve a similar problem as discussed in