Sequential Convex Programming for Computing Information-Theoretic Minimal Partitions: Nonconvex Nonsmooth Optimization (Q4689645): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:00, 7 February 2024
scientific article; zbMATH DE number 6957104
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sequential Convex Programming for Computing Information-Theoretic Minimal Partitions: Nonconvex Nonsmooth Optimization |
scientific article; zbMATH DE number 6957104 |
Statements
Sequential Convex Programming for Computing Information-Theoretic Minimal Partitions: Nonconvex Nonsmooth Optimization (English)
0 references
17 October 2018
0 references
information theory
0 references
total variation regularization
0 references
image partitioning
0 references
difference of convex functions
0 references
stochastic optimization
0 references
