Primal-dual subgradient method for constrained convex optimization problems
From MaRDI portal
Abstract: This paper considers a general convex constrained problem setting where functions are not assumed to be differentiable nor Lipschitz continuous. Our motivation is in finding a simple first-order method for solving a wide range of convex optimization problems with minimal requirements. We study the method of weighted dual averages (Nesterov, 2009) in this setting and prove that it is an optimal method.
This page was built for publication: Primal-dual subgradient method for constrained convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6349954)
