We consider the decomposition of a maximal monotone operator into the
sum of an antisymmetric operator and the subdifferential of a proper lower
semicontinuous convex function. This is a variant of the well-known decomposition of a matrix into its symmetric and antisymmetric part. We analyze in detail the case when the graph of the operator is a linear subspace. Equivalent conditions of monotonicity are also provided.
We obtain several new results on auto-conjugate representations including an explicit formula that is built upon the proximal average of the associated Fitzpatrick function and its Fenchel conjugate. These results are
new and they both extend and complement recent work by Penot, Simons
and Zălinescu. A nonlinear example shows the importance of the linearity
assumption. Finally, we consider the problem of computing the Fitzpatrick
function of the sum, generalizing a recent result by Bauschke, Borwein and
Wang on matrices to linear relations. / Graduate Studies, College of (Okanagan) / Graduate
| Identifer | oai:union.ndltd.org:UBC/oai:circle.library.ubc.ca:2429/2807 |
| Date | 05 1900 |
| Creators | Yao, Liangjin |
| Publisher | University of British Columbia |
| Source Sets | University of British Columbia |
| Language | English |
| Detected Language | English |
| Type | Text, Thesis/Dissertation |
| Format | 761563 bytes, application/pdf |
| Rights | Attribution-NonCommercial-NoDerivatives 4.0 International, http://creativecommons.org/licenses/by-nc-nd/4.0/ |
Page generated in 0.0021 seconds