Conjugate Duality in Convex Optimization

255 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Forward-Backward and Tseng’s Type Penalty Schemes for Monotone Inclusion Problems (2013, methodology): “For the readers convenience we present ﬁrst some notations which are used throughout the paper (see [4, 7, 8, 16, 22, 25]).”
Inertial Douglas-Rachford splitting for monotone inclusion problems (2014, methodology): “ the inertial Douglas-Rachford primal-dual algorithm can be implemented when solving a primal-dual pair of convex optimization problems. We recall rst some notations used in the variational case, see [6,8,9,24,35,37]. For a function f : H!R, where R := R [f1g is the extended real line, we denote by ”
A Hybrid Proximal-Extragradient Algorithm with Inertial Effects (2014, unknown): “R. I. Boţ (2010).”