A new proof for Rockafellar’s characterization of maximal monotone operators

By Stephen Simons, Constantin Zalinescu. 2004

46 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/defa0fecdc63f4796d57268e8f22d24419a7346e

How researchers see this paper

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

In Computational Theory and Mathematics

In Geometry and Topology

In Mathematical Physics

Citations in the corpus

Fitzpatrick functions, cyclic monotonicity and Rockafellar's antiderivative (2007, background): “The following result is due to Rockafellar [39, Corollary on page 78]; recently, Simons and Zualinescu [ 44 ] and Borwein [9] gave new, simpler and more analytic proofs of it based on the Fitzpatrick function.”
Convex Functions: Constructions, Characterizations and Counterexamples (2010, methodology): “We now prove our central result whose proof – originally very hard and due to Rockafellar [370] – has been revisited over many years culminating in the results in [391, 398, 399, 446, 121] among others:”
Fitzpatrick functions: inequalities, examples, and remarks on a problem by S. Fitzpatrick (2005, background): “In 1988, Simon Fitzpatrick (see [6, Definition 3.1]) investigated the following function which has been utilized recently in [3], [8], [9], [17], and [ 16 ].”
Maximality of sums of two maximal monotone operators in general Banach space (2007, methodology): “We now prove our asserted result—whose proof originally very hard and due to Rockafellar [12]—has been revisited over many years culminating in [14, 7, 10, 16, 6] among others.”
The kernel average for two convex functions and its application to the extension and representation of monotone operators (2009, unknown): “The Fitzpatrick function [10] associated with A has recently turned out to be a very effective tool for analyzing A; see, e.g., [1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 21 , 22, 23].”