Mathematical programming for the sum of two convex functions with applications to lasso problem, split feasibility problems, and image deblurring problem (Q288028)
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: Mathematical programming for the sum of two convex functions with applications to lasso problem, split feasibility problems, and image deblurring problem |
scientific article; zbMATH DE number 6584088
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mathematical programming for the sum of two convex functions with applications to lasso problem, split feasibility problems, and image deblurring problem |
scientific article; zbMATH DE number 6584088 |
Statements
Mathematical programming for the sum of two convex functions with applications to lasso problem, split feasibility problems, and image deblurring problem (English)
0 references
24 May 2016
0 references
lasso problem
0 references
mathematical programming for the sum of two functions
0 references
split feasibility problem
0 references
gradient-projection algorithm
0 references
proximal point algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0.8928373456001282
0 references
0.7828805446624756
0 references
0.7696717381477356
0 references
0.7664812207221985
0 references
0.7645142674446106
0 references
