A relaxed alternating projection method for solving a linear matrix equation problem under closed convex constraints (Q2926741)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6363826
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A relaxed alternating projection method for solving a linear matrix equation problem under closed convex constraints |
scientific article; zbMATH DE number 6363826 |
Statements
3 November 2014
0 references
linear matrix equation
0 references
alternating projection method
0 references
relaxed alternating projection method
0 references
convergence
0 references
algorithm
0 references
numerical examples
0 references
A relaxed alternating projection method for solving a linear matrix equation problem under closed convex constraints (English)
0 references
0.8779271841049194
0 references
0.7909678220748901
0 references
0.7828017473220825
0 references
0.7742829322814941
0 references
