Dictionary descent in optimization (Q519963): Difference between revisions

The author studies a problem of convex optimization. He shows that with the algorithms studied utilize dictionaries instead of a canonical basis used in the coordinate descent algorithms. Also, this approach allows him to reduce the dimensionality of the problem. An interesting theoretical study about this process is given.

0 references

reviewed by

Antonio López-Carmona

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

sparse

0 references

optimization

0 references

greedy

0 references

Banach space

0 references

convergence rate

0 references

author

Vladimir N. Temlyakov

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Convex analysis and nonlinear optimization. Theory and examples.

0 references

Deterministic constructions of compressed sensing matrices

0 references

Covering spheres with spheres

0 references

Q4471300

0 references

Q4069280

0 references

On the size of incoherent systems

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Covering a sphere with spheres

0 references

Greedy algorithms in Banach spaces

0 references

Greedy Approximation

0 references

Greedy approximation in convex optimization

0 references

Greedy expansions in convex optimization

0 references

SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES

0 references

Incoherent systems and coverings in finite dimensional Banach spaces

0 references

Covering a ball with smaller equal balls in \(\mathbb R^n\)

0 references

Sparse Recovery With Orthogonal Matching Pursuit Under RIP

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:519963

@@ Property / author @@
-Q219318
@@ Property / author: Q219318 / rank @@
-Normal rank
@@ Property / review text @@
+The author studies a problem of convex optimization. He shows that with the algorithms studied utilize dictionaries instead of a canonical basis used in the coordinate descent algorithms. Also, this approach allows him to reduce the dimensionality of the problem. An interesting theoretical study about this process is given.
+Normal rank
@@ Property / reviewed by @@
+Antonio López-Carmona
@@ Property / reviewed by: Antonio López-Carmona / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+A46
@@ Property / Mathematics Subject Classification ID: 41A46 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+K05
@@ Property / Mathematics Subject Classification ID: 65K05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+A65
@@ Property / Mathematics Subject Classification ID: 41A65 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B20
@@ Property / Mathematics Subject Classification ID: 46B20 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6699185
@@ Property / zbMATH DE Number: 6699185 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+sparse
@@ Property / zbMATH Keywords: sparse / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+optimization
@@ Property / zbMATH Keywords: optimization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+greedy
@@ Property / zbMATH Keywords: greedy / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Banach space
@@ Property / zbMATH Keywords: Banach space / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+convergence rate
@@ Property / zbMATH Keywords: convergence rate / rank @@
+Normal rank
@@ Property / author @@
+Vladimir N. Temlyakov
@@ Property / author: Vladimir N. Temlyakov / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963473800
@@ Property / OpenAlex ID: W2963473800 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.01304
@@ Property / arXiv ID: 1511.01304 / rank @@
+Normal rank
@@ Property / cites work @@
+Convex analysis and nonlinear optimization. Theory and examples.
+Normal rank
@@ Property / cites work @@
+Deterministic constructions of compressed sensing matrices
+Normal rank
@@ Property / cites work @@
+Covering spheres with spheres
@@ Property / cites work: Covering spheres with spheres / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471300
@@ Property / cites work: Q4471300 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4069280
@@ Property / cites work: Q4069280 / rank @@
+Normal rank
@@ Property / cites work @@
+On the size of incoherent systems
@@ Property / cites work: On the size of incoherent systems / rank @@
+Normal rank
@@ Property / cites work @@
+Introductory lectures on convex optimization. A basic course.
+Normal rank
@@ Property / cites work @@
+Covering a sphere with spheres
@@ Property / cites work: Covering a sphere with spheres / rank @@
+Normal rank
@@ Property / cites work @@
+Greedy algorithms in Banach spaces
@@ Property / cites work: Greedy algorithms in Banach spaces / rank @@
+Normal rank
@@ Property / cites work @@
+Greedy Approximation
@@ Property / cites work: Greedy Approximation / rank @@
+Normal rank
@@ Property / cites work @@
+Greedy approximation in convex optimization
@@ Property / cites work: Greedy approximation in convex optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Greedy expansions in convex optimization
@@ Property / cites work: Greedy expansions in convex optimization / rank @@
+Normal rank
@@ Property / cites work @@
+SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES
+Normal rank
@@ Property / cites work @@
+Incoherent systems and coverings in finite dimensional Banach spaces
+Normal rank
@@ Property / cites work @@
+Covering a ball with smaller equal balls in \(\mathbb R^n\)
+Normal rank
@@ Property / cites work @@
+Sparse Recovery With Orthogonal Matching Pursuit Under RIP
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:519963