Generalized subdifferentials of the sign change counting function

DOI10.1007/S10898-015-0332-1MaRDI QIDQ6826214zbMATH OpenFDO

Authors Dominique Fortin, Ider Tseveendorj

Publication date 4 May 2016

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10898-015-0332-1

zbMATH Keywords

generalized subdifferential optimality conditions sign counting

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Review text

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.

This page was built for publication: Generalized subdifferentials of the sign change counting function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6826214)