# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
An inexact method of partial inverses and a parallel bundle method. (English) Zbl 1091.49006
Summary: For a maximal monotone operator $T$ on a Hilbert space $H$ and a closed subspace $A$ of $H$, we consider the problem of finding $\left(x,y\in T\left(x\right)\right)$ satisfying $x\in A$ and $y\in {A}^{\perp }$. An equivalent formulation of this problem makes use of the partial inverse operator of Spingarn. The resulting generalized equation can be solved by using the proximal point algorithm. We consider instead the use of hybrid proximal methods. Hybrid methods use enlargements of operators, close in spirit to the concept of $\epsilon$-subdifferentials. We characterize the enlargement of the partial inverse operator in terms of the enlargement of $T$ itself. We present a new algorithm of resolution that combines Spingarn and hybrid methods, we prove for this method global convergence only assuming existence of solutions and maximal monotonicity of T. We also show that, under standard assumptions, the method has a linear rate of convergence. For the important problem of finding a zero of a sum of maximal monotone operators ${T}_{1},\cdots ,{T}_{m}$, we present a highly parallelizable scheme. Finally, we derive a parallel bundle method for minimizing the sum of polyhedral functions.
##### MSC:
 49J40 Variational methods including variational inequalities 49J52 Nonsmooth analysis (other weak concepts of optimality) 47N10 Applications of operator theory in optimization, convex analysis, programming, economics 65J15 Equations with nonlinear operators (numerical methods) 47H05 Monotone operators (with respect to duality) and generalizations
PLCP