4 edited title

# Solving constrained optimization problem: projected gradient vs. dual?

3 edited tags
2 deleted 9 characters in body

I recently got to know about projected gradient descent and have a question. My understanding is that when you have constrained optimization problem, you use the duality to solve an easier dual problem, which also gives an answer to the original problem. Is the projected gradient descent just another method for solving constrained optimization problems? If so, when do people use the projected gradient descent instead of duality and vice versa?

Thanks,

I recently got to know about projected gradient descent and have a question. My understanding is that when you have constrained optimization problem, you use the duality to solve an easier dual problem, which also gives an answer to the original problem. Is the projected gradient descent just another method for solving constrained optimization problems? If so, when do people use the projected gradient descent instead of duality and vice versa?

Thanks,

I recently got to know about projected gradient descent and have a question. My understanding is that when you have constrained optimization problem, you use the duality to solve an easier dual problem, which also gives an answer to the original problem. Is the projected gradient descent just another method for solving constrained optimization problems? If so, when do people use the projected gradient descent instead of duality and vice versa?

1