On solvability of monotone type problems with non-coercive set-valued operators (Q2711783)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On solvability of monotone type problems with non-coercive set-valued operators |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On solvability of monotone type problems with non-coercive set-valued operators |
scientific article |
Statements
25 April 2001
0 references
set-valued operator
0 references
monotone operator
0 references
coercive operator
0 references
\(p\)-Laplacian
0 references
localization procedure
0 references
0.89202505
0 references
0.88861555
0 references
0.88003516
0 references
0.87821555
0 references
On solvability of monotone type problems with non-coercive set-valued operators (English)
0 references
The author studies inclusions \(A(u)\ni f\), where \(A\) is an operator of monotone type. The idea is to consider an auxiliary problem \(A(u)+G(u)\ni f+u\), where the right-hand side is perturbed by a parameter \(u\), and the left-hand side contains the perturbed operator \(A+G\) with better properties. The perturbations are chosen in such a way that they compensate each other. Then a localization procedure gives a solution of the initial problem. As examples problems with a weighted \(p\)-Laplacian are considered.
0 references
