# Complexity of active set method for Quadratic Programming

The Quadratic Programming problem is as follows:

$$\min_x \{\frac12x^THx+x^Tg\}$$

$$Ax\le b$$ where $H$ is symmetric and positive semi-definite.

What is the complexity of the active set method for quadratic programming?

The complexity might be dependant on size of $x$ or both size of $x$ and size of constraints.

• This is an exercise in Google and Wikipedia that you don't need us for. – Yuval Filmus Mar 13 '16 at 16:01
• Sounds like you should be looking for a course in combinatorial optimization, not a Q&A platform. – G. Bach Mar 13 '16 at 20:19
• We'd prefer that you ask one question, not six. Also, we want you to do a significant amount of research before asking, and show us in the question where you looked and what you've found. What research have you done? Where did you look? See cs.stackexchange.com/help/how-to-ask. – D.W. Mar 13 '16 at 21:20
• Great, thank you for narrowing the question. Now, I imagine that the next thing community members will likely be wondering is: what research have you done? Where have you looked, and what have you found so far? See my prior comment. – D.W. Mar 14 '16 at 5:10
• @D.W., I have found Active set method in page 7 but its mathematics are so heavy for me to understand it. – ar2015 Mar 14 '16 at 6:34