Re: [sage-support] Re: Solving a set of quadratic inequalities (continuous)

2012-04-26 Thread Volker Braun
I thought the variables are real in the OP, non?

Then you can split n linear inequalitiies abs(sum(p_i))>1 into 2^n cases 
sum(p_i))>1 or sum(p_i))<-1



On Wednesday, April 25, 2012 2:56:45 AM UTC-4, Nathann Cohen wrote:
>
> Hello !!!
>
> > Do you mean to say that you have complex numbers p_j and your 
> inequalities
> > are of the form
> > |p_j-p_k|<=C and |p_j-p_k|>=D, and that you also have
> > some equations on Re(p_j) and Im(p_j) ?
>
> Oh, well, if you have something like that it would of course solve my
> problem too :-)
>
> Nathann
>
>

-- 
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to 
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at 
http://groups.google.com/group/sage-support
URL: http://www.sagemath.org


Re: [sage-support] Re: Solving a set of quadratic inequalities (continuous)

2012-04-26 Thread Dima Pasechnik


On Thursday, 26 April 2012 23:32:01 UTC+8, Nathann Cohen wrote:
>
> Hell !!! 
>
> > it should not be hard to deal with the case when you don't have 
> inequalities 
> > like |p_j-p_k|>=D, but only |p_j-p_k|<=C. 
> > This would make your problem convex, etc. 
>
> Indeed, but in this case all my problems would have a trivial solution 
> ==> all variables equal to zero :-) 
>

well, you mentioned that you also have equations...
 

>
> Nathann 
>

-- 
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to 
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at 
http://groups.google.com/group/sage-support
URL: http://www.sagemath.org


Re: [sage-support] Re: Solving a set of quadratic inequalities (continuous)

2012-04-26 Thread Nathann Cohen
Hell !!!

> it should not be hard to deal with the case when you don't have inequalities
> like |p_j-p_k|>=D, but only |p_j-p_k|<=C.
> This would make your problem convex, etc.

Indeed, but in this case all my problems would have a trivial solution
==> all variables equal to zero :-)

Nathann

-- 
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to 
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at 
http://groups.google.com/group/sage-support
URL: http://www.sagemath.org


Re: [sage-support] Re: Solving a set of quadratic inequalities (continuous)

2012-04-26 Thread Dima Pasechnik


On Wednesday, 25 April 2012 14:56:45 UTC+8, Nathann Cohen wrote:
>
> Hello !!!
>
> > Do you mean to say that you have complex numbers p_j and your 
> inequalities
> > are of the form
> > |p_j-p_k|<=C and |p_j-p_k|>=D, and that you also have
> > some equations on Re(p_j) and Im(p_j) ?
>
> Oh, well, if you have something like that it would of course solve my
> problem too :-)
>
it should not be hard to deal with the case when you don't have 
inequalities like |p_j-p_k|>=D, but only |p_j-p_k|<=C.
This would make your problem convex, etc.

 

> Nathann
>
>

-- 
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to 
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at 
http://groups.google.com/group/sage-support
URL: http://www.sagemath.org


Re: [sage-support] Re: Solving a set of quadratic inequalities (continuous)

2012-04-24 Thread Nathann Cohen
Hello !!!

> Do you mean to say that you have complex numbers p_j and your inequalities
> are of the form
> |p_j-p_k|<=C and |p_j-p_k|>=D, and that you also have
> some equations on Re(p_j) and Im(p_j) ?

Oh, well, if you have something like that it would of course solve my
problem too :-)

Nathann

-- 
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to 
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at 
http://groups.google.com/group/sage-support
URL: http://www.sagemath.org


[sage-support] Re: Solving a set of quadratic inequalities (continuous)

2012-04-24 Thread Dima Pasechnik


On Friday, 13 April 2012 21:59:55 UTC+8, Nathann Cohen wrote:
>
> Hello everybody !!!
>
> I would like to solve a set of equations with a very easy shape. My
> equations are defined on variables p1_x, p1_y, p2_x, p2_y, ..., and I
> would like to obtain values for them satisfying constraints like :
>
> |p1 - p2| < 1, i.e.  (p1_x - p2_x)^2 + (p1_y - p2_y)^2 < 1
>
> or something similar with a > instead of <. I do not really mind
> whether the inequalities are strict or not, as I feel free to replace
> < 1 by <= 0.9.
>

Do you mean to say that you have complex numbers p_j and your inequalities 
are of the form
|p_j-p_k|<=C and |p_j-p_k|>=D, and that you also have
some equations on Re(p_j) and Im(p_j) ?

(as the subject talks about inequalities, but here you talk about 
equations, I assume you can have both, no?)

 

> Would you know of any way to solve this type of equations, or to
> ensure that no solution exists ?
>
> Thank yo ! :-)
>
> Nathann
>
>

-- 
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to 
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at 
http://groups.google.com/group/sage-support
URL: http://www.sagemath.org