Results 161 to 170 of about 19,030 (190)
Some of the next articles are maybe not open access.
Parallel Subgradient Methods for Convex Optimization
2001We study subgradient methods for minimizing a sum of convex functions over a closed convex set. To generate a search direction, each iteration employs subgradients of a subset of the objectives evaluated at the current iterate, as well as past subgradients of the remaining objectives.
openaire +1 more source
Subgradient Extragradient Method with Double Inertial Steps for Variational Inequalities
Journal of Scientific Computing, 2022Yong-Hong Yao, Olaniyi S Iyiola, Yekini
exaly
Nondifferentiable Optimization: Subgradient Optimization Methods, Subgradient Methods
2012openaire +1 more source
Distributed Subgradient Methods for Multi-Agent Optimization
IEEE Transactions on Automatic Control, 2009Angelia Nedich
exaly
Primal-dual subgradient methods for convex problems
Mathematical Programming, 2007Yurii Nesterov
exaly

