On optimization properties of functions, with a concave minorant
The aim of the paper is to study the so-called c.m. class of functions, which admit a concave minorant at any point. This class of functions is strictly contained in the class of lower semicontinuous functions, even though any function in the latter class can be represented as the supremum of countably many concave functions. On the other hand, the c.m. class strictly contains another class used in global optimization, namely the class of functions representable as the difference of two convex functions. The stability of the c.m. class with respect to several operations is investigated and it is proved that the problem of the global minimization of a c.m. function can be approximated by a sequence of concave programming problems. The case when the domain of the function is a polytope is investigated in greater detail.
- scientific article; zbMATH DE number 1421262
- Minimisation de fonctionnelles dans un ensemble de fonctions convexes
- scientific article; zbMATH DE number 2208631
- On the global minimization of concave functions
- scientific article; zbMATH DE number 5181939
- scientific article; zbMATH DE number 1377657
- scientific article; zbMATH DE number 3918113
- Minimizing a concave function over a compact convex set
- Minimization of an M-convex function
- Minimum Problems over Sets of Concave Functions and Related Questions
- Minorant methods of stochastic global optimization
- Quadratic support functions in quadratic bilevel problems
- scientific article; zbMATH DE number 2208631 (Why is no real title available?)
- Submodular maximization and its generalization through an intersection cut lens
- Reliability optimization of a complex system by the stochastic branch and bound method
This page was built for publication: On optimization properties of functions, with a concave minorant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1284412)