Zilupe

Quadratic programming

Hello Jāzeps, and welcome here. I'm afraid I have undone your edit to Quadratic programming again. All the definitions of quadratic programming that I'm familiar with states that the constraints must be linear. That may seem illogical, but that's what the literature says, and our policy is to follow the literature (this is called verifiability in Wikipedia jargon). So if you know of an instance in the literature where they use your definition, with quadratic constraints, please say so and we may be able to use it to improve the article. Otherwise, please don't change it again.

Anyway, I hope you like this place and that I see you around. The page on quadratic programming is a mess, so it would be great if you could do some work on it. -- Jitse Niesen (talk) 09:49, 11 June 2008 (UTC)

(I don't know how do I reply user messages - I hope I am doing it right) The books is called Approximation Algorithms, written by Vijay V. Vazirani, published by Springer, 2001. I am now checking it and it is talking about strict quadratic programs, which is a more restricted case, so I was probably wrong. I am still quite new to this topic, but in that book the constraints look like y*y=1. We also have the problem defined in a simpler way. Google books link to the exact page Zilupe (talk) 20:16, 19 June 2008 (UTC)

You're doing great. The book by Vazirani is about integer programming, where all the variables are assumed to be integers. That's an area I'm not familiar with. It may well be that in integer programming, quadratic programs may have quadratic constraints. Would you be able to summarize what Vazirani has to say about this subject? You can add it to quadratic programming. -- Jitse Niesen (talk) 10:26, 20 June 2008 (UTC)