Sequential Convex Programming for Computing Information-Theoretic Minimal Partitions: Nonconvex Nonsmooth Optimization (Q4689645): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/16m1078653 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2765530422 / rank | |||
Normal rank | |||
Latest revision as of 08:22, 30 July 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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
