It is widely known that interior point method has been used for convex optimization problem.
However, the intermediary step of interior point method is usually consist of the Newton method. This may make the speed become terribly slow since Newton method is second order method.
Should projected gradient descent be used for solving convex optimization problem instead of interior point method for convex problem ?