Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces (Q2943971): Difference between revisions
From MaRDI portal
Changed an Item |
Changed label, description and/or aliases in en, and other parts |
||
| label / en | label / en | ||
Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces | |||
| Property / arXiv classification | |||
math.OC | |||
| Property / arXiv classification: math.OC / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
math.NA | |||
| Property / arXiv classification: math.NA / rank | |||
Normal rank | |||
Latest revision as of 12:47, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
