A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting (Q670659)
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: A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting |
scientific article |
Statements
A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting (English)
0 references
18 March 2019
0 references
Douglas-Rachford algorithm
0 references
feasibility problem
0 references
global convergence
0 references
graph of a function
0 references
linear convergence
0 references
Lyapunov function
0 references
method of alternating projections
0 references
Newton's method
0 references
nonconvex set
0 references
projection
0 references
stability
0 references
zero of a function
0 references
0 references
0 references
0 references
0 references
0 references
0.8546576499938965
0 references
0.8517885804176331
0 references
0.8479499220848083
0 references
0.847001314163208
0 references
