Convexification, concavification and monotonization in global optimization
The authors introduce a new approach by which via certain convexification, concavification and monotonization schemes a nonconvex optimization problem, over a simplex, can be converted into an equivalent better-structured nonconvex one. In this way studying a concave optimization problem or a D.C. (where D.C. stands for the difference of two convex functions) by means of the analytical tools proposed, the authors solve some interesting global optimization problems. The novel approach introduced in this paper, de facto, closes a gap between the generality and efficency in the current literature of global optimization.
- Convexification and concavification for a general class of global optimization problems
- Convexification and concavification for a class of non-monotone optimization problems
- Convexification and concavification methods for some global optimization problems
- A class of convexification and concavification methods for non-monotone optimization problems
- On convexification for a class of global optimization problems
- The complementary convex structure in global optimization
- An exact solution method for reliability optimization in complex systems
- Hidden convex minimization
- Global optimization by monotonic transformation
- Convexification and concavification methods for some global optimization problems
- A survey of hidden convex optimization
- A branch-and-bound based method for solving monotone optimization problems
- A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs
- Monotonization in global optimization
- On convexification for a class of global optimization problems
- Convexity and montonicity in global optimization.
- Convexification approaches for a class of continuous global optimization problem
- A class of convexification and concavification methods for non-monotone optimization problems
- scientific article; zbMATH DE number 2153021 (Why is no real title available?)
- scientific article; zbMATH DE number 2159407 (Why is no real title available?)
- Global descent methods for unconstrained global optimization
- A NOVEL MONOTONIZATION TRANSFORMATION FOR SOME CLASSES OF GLOBAL OPTIMIZATION PROBLEMS
- Convexification and concavification for a class of non-monotone optimization problems
- Convexification and monotone optimization
- Convexification and concavification for a general class of global optimization problems
- A convexification method for a class of global optimization problems with applications to reliability optimization
- Convexification for a class of global optimization problems with \(C^{1, 1}\) functions
- Fast Gaussian kernel learning for classification tasks based on specially structured global optimization
- Convexification of nonsmooth monotone functions
This page was built for publication: Convexification, concavification and monotonization in global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959334)
