Solving monotone inclusions with linear multi-step methods. (Q1404232): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10107-002-0366-2 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10107-002-0366-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037917162 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10107-002-0366-2 / rank | |||
Normal rank | |||
Latest revision as of 19:29, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving monotone inclusions with linear multi-step methods. |
scientific article |
Statements
Solving monotone inclusions with linear multi-step methods. (English)
0 references
20 August 2003
0 references
The authors derive a new class of proximal-like algorithms for solving monotone inclusions of the form \(0\in T(x)\), where \(T\) is a set-valued mapping on a real Hilbert space. The algorithms are obtained by applying linear multi-step methods of numerical integration in order to solve the differential inclusion \(\dot x(t)\in T(x(t))\) which can be viewed as a generalization of the steepest descent method for a convex function. Convergence properties are studied.
0 references
proximal-like algorithms
0 references
monotone inclusions
0 references
set-valued mapping
0 references
Hilbert space
0 references
linear multi-step methods
0 references
differential incusion
0 references
steepest descent method
0 references
convergence
0 references
