Generalized subdifferentials of the sign change counting function (Q276504)
From MaRDI portal
(Redirected from Item:Q5256629)
 | 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: Generalized subdifferentials of the sign change counting function |
scientific article; zbMATH DE number 6447462
- Minimizing Sign Changes Rowwise: Consecutive Ones Property and Beyond
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generalized subdifferentials of the sign change counting function |
scientific article; zbMATH DE number 6447462 |
|
Statements
Generalized subdifferentials of the sign change counting function (English)
0 references
Minimizing Sign Changes Rowwise: Consecutive Ones Property and Beyond (English)
0 references
4 May 2016
0 references
19 June 2015
0 references
By introducing the sign change counting function (to count the number of transitions between contiguous locations) as a natural extension of the sign counting function (on binary values), the authors consider a generalized subdifferential for this sign change counting function, which allows them to prove global optimality at some point, for the \(4\)-dimensional first nontrivial example. It is noticed that such a generalized subdifferential is suitable whereas the classical subdifferentials are intractable.
0 references
sign counting
0 references
generalized subdifferential
0 references
optimality conditions
0 references
0--1 matrices
0 references
minimization
0 references
consecutive 1s property
0 references
consecutive sign property
0 references
trigraph
0 references
0 references
0 references
0 references
0.753939688205719
0 references
