Monotonic Optimization: Problems and Solution Approaches
SIAM Journal on Optimization
A Finite Algorithm for Globally Optimizing a Class of Rank-Two Reverse Convex Programs
Journal of Global Optimization
Optimization of Polynomial Fractional Functions
Journal of Global Optimization
Hi-index | 0.00 |
A new efficient branch and bound method is proposed for solving convex programs with an additional monotonic nonconvex constraint. Computational experiments demonstrated that this method is quite practical for solving rank k reverse convex programs with much higher values of k than previously considered in the literature and can be applied to a wider class of nonconvex problems.