On the Convergence of Inexact Projection Primal First-Order Methods for Convex Minimization
Sign Up to like & getrecommendations! Published in 2018 at "IEEE Transactions on Automatic Control"
DOI: 10.1109/tac.2018.2805727
Abstract: It is well-known that primal first-order algorithms achieve sublinear (linear) convergence for smooth convex (smooth strongly convex) constrained minimization. However, these methods encounter numerical difficulties when the primal feasible set is complicated, since they require… read more here.
Keywords: first order; order methods; primal first; projection ... See more keywords