Generalized Subdifferentials of the Sign Change Counting Function

Dominique Fortin 1 Ider Tseveendorj 2
1 GANG - Networks, Graphs and Algorithms
LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications, Inria Paris-Rocquencourt
Abstract : The counting function on binary values is extended to the signed case in order to count the number of transitions between contiguous locations. A generalized subdifferential for the sign change counting function is given where classical subdifferentials remain intractable. An attempt to prove global optimality at some point, for the 4-dimensional first non trivial example, is made by using a sufficient condition specially tailored among all the cases for this subdifferential.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

https://hal.inria.fr/hal-00915606
Contributor : Dominique Fortin <>
Submitted on : Monday, December 9, 2013 - 9:35:11 AM
Last modification on : Friday, January 4, 2019 - 5:33:21 PM

Links full text

Identifiers

  • HAL Id : hal-00915606, version 1
  • ARXIV : 1312.1814

Collections

Citation

Dominique Fortin, Ider Tseveendorj. Generalized Subdifferentials of the Sign Change Counting Function. 2013. ⟨hal-00915606⟩

Share

Metrics

Record views

388