Quasiconvex functions: how to separate, if you must!
DOI:
https://doi.org/10.24193/subbmath.2022.1.08Keywords:
quasiconvex minimization, separation, quasidifferentialityAbstract
Since quasiconvex functions have convex lower level sets it is possible
to minimize them by means of separating hyperplanes. An example of such a procedure, well-known for convex functions, is the
subgradient method. However, to find the normal vector of a separating hyperplane is in general not easy for the quasiconvex case.
This paper attempts to gain some insight into the {\em computational} aspects of determining such a normal vector and the geometry of lower level sets of quasiconvex functions. In order to do so, the directional differentiability of quasiconvex functions is
thoroughly studied. As a consequence of that study, it is shown that an important subset of quasiconvex functions belongs to the class of quasidifferentiable functions. The main emphasis is, however, on computing actual separators. Some important
examples are worked out for illustration.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Transfer of copyright agreement: When the article is accepted for publication, the authors and the representative of the coauthors, hereby agree to transfer to Studia Universitatis Babeș-Bolyai Mathematica all rights, including those pertaining to electronic forms and transmissions, under existing copyright laws, except for the following, which the authors specifically retain: the authors can use the material however they want as long as it fits the NC ND terms of the license. The authors have all rights for reuse according to the license.
