Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces (Q2943971)
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: Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces |
scientific article |
Statements
7 September 2015
0 references
best approximation
0 references
convex set
0 references
curve fitting
0 references
Douglas-Rachford splitting algorithm
0 references
Dykstra's method
0 references
feasibility
0 references
halfspace
0 references
interpolation
0 references
linear inequalities
0 references
method of cyclic projections
0 references
projection
0 references
road design
0 references
superiorization
0 references
numerical experiment
0 references
nonconvex problem
0 references
math.OC
0 references
math.NA
0 references
0.8292466402053833
0 references
0.8172826170921326
0 references
0.7925561666488647
0 references
0.7817457914352417
0 references
0.7805646657943726
0 references
