IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-319-89800-1_3.html
   My bibliography  Save this book chapter

On the Maximality of the Sum of Two Maximal Monotone Operators

In: Current Research in Nonlinear Analysis

Author

Listed:
  • Yuqing Chen

    (Guangdong University of Technology)

  • Yeol Je Cho

    (Gyeongsang National University
    China Medical University)

  • Themistocles M. Rassias

    (National Technical University of Athens)

Abstract

Let E be a real reflexive Banach space, E ∗ be the dual space of E and T : D ( T ) ⊆ E → 2 E ∗ $$T: D(T)\subseteq E\to 2^{E^{*}}$$ , S : D ( S ) ⊆ E → 2 E ∗ $$S:D(S)\subseteq E\to 2^{E^*}$$ be two maximal monotone operators such that D(T) ∩ D(S) ≠ ∅. Assume that there exist x 0 ∈ E, r > 0, λ 0 > 0 such that inff ∈ Tx(f, x − x 0) is lower bounded on each bounded subset of D(T) and, if, for each y ∈ B(x 0, r), g ∈ E ∗, x n ∈ D(T) and λ n ∈ (0, λ 0) with g ∈ T x n + S λ n x n + J x n $$g\in Tx_n+ S_{\lambda _n}x_n+Jx_n$$ for each n = 1, 2, ⋯, { R λ n S x n } = 1 ∞ $$\{R_{\lambda _n}^Sx_n\}_{=1}^{\infty }$$ is bounded, then we have inf n ≥ 1 ( S λ n x n , R λ n S x n − y ) > − ∞ , $$\displaystyle \inf _{n\geq 1}(S_{\lambda _n}x_n,R_{\lambda _n}^Sx_n-y)>-\infty , $$ where R λ S $$R_{\lambda }^S$$ is the Yosida resolvent of S, then T + S is maximal monotone. Also, we construct a degree theory for the sum of two maximal monotone operators, where the sum may not be maximal monotone, and the degree theory is also applied to study the operator equation 0 ∈ (T + S)x. Finally, we give some applications of the main results to nonlinear partial differential equations.

Suggested Citation

  • Yuqing Chen & Yeol Je Cho & Themistocles M. Rassias, 2018. "On the Maximality of the Sum of Two Maximal Monotone Operators," Springer Optimization and Its Applications, in: Themistocles M. Rassias (ed.), Current Research in Nonlinear Analysis, pages 61-83, Springer.
  • Handle: RePEc:spr:spochp:978-3-319-89800-1_3
    DOI: 10.1007/978-3-319-89800-1_3
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-3-319-89800-1_3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.