Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Convex programs with an additional reverse convex constraint
Journal of Optimization Theory and Applications
USSR Computational Mathematics and Mathematical Physics
Precision, complexity, and computational schemes of the cubic algorithm
Journal of Optimization Theory and Applications
An algorithm for global optimization of Lipschitz continuous functions
Journal of Optimization Theory and Applications
One dimensional global optimization using linear lower bounds
Recent advances in global optimization
The bisection method in higher dimensions
Mathematical Programming: Series A and B
A deterministic algorithm for global optimization
Mathematical Programming: Series A and B
Piyavskii's method for solving the general global optimization problem
Computational Mathematics and Mathematical Physics
A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems
Mathematical Programming: Series A and B - Special issue: Festschrift in Honor of Philip Wolfe part II: studies in nonlinear programming
Convex analysis and variational problems
Convex analysis and variational problems
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Reliability optimization of a complex system by the stochastic branch and bound method
Cybernetics and Systems Analysis
| Hi-index | 0.00 |
We give a definition of the class of functions with a concave minorant and compare these functions with other classes of functions often used in global optimization, e.g. weakly convex functions, d.c. functions, Lipschitzian functions, continuous and lower semicontinuous functions. It is shown that the class of functions with a concave minorant is closed under operations mainly used in optimization and how a concave minorant can be constructed for a given function.