[Ipopt] quadratic programming

[Anand]

Hi
Over the last 3 days I have been searching the internet for a open source
quadratic programming library in c/c++
My problem is:
minimize xHx' + xf
subject to:
lb <= x <= ub

where H is an identity matrix and hence sparse for large dimensions
x is a vector

lb and ub are the lower and upper bounds respectively on the vector x
Does ipopt solve such a problem

Please tell me if you have any open source c/c++ library
Also if possible give me suggestions as to what algorithms may be able to
solve these algorithms

Thanks
Regards
Anand
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://list.coin-or.org/pipermail/ipopt/attachments/20080915/35a2eeda/attachment.html