Sign up ×
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It's 100% free, no registration required.

What are the fastest known algorithms for general convex optimisation under linear inequality constraints?

share|cite|improve this question
That's a pretty wide question... – Yuval Filmus Feb 11 '13 at 15:40
In which direction would you like to see it narrowed? – alang Feb 11 '13 at 23:58
It shouldn't necessarily be narrowed - but the answer should be a mini-survey. – Yuval Filmus Feb 12 '13 at 5:26

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.