An alogrithm for monotonic global optimization problems∗

DOI10.1080/02331930108844530zbMath1030.90093OpenAlexW2015883438MaRDI QIDQ2720273

Hoang Tuy, Heather Mays, Alexander Rubinov

Publication date: 22 January 2003

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930108844530

zbMATH Keywords

outer approximationincreasing functionfeasible setabstract quasiconvexity

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37)

Related Items

On convexification for a class of global optimization problems, Convexification of nonsmooth monotone functions, A branch-and-bound based method for solving monotone optimization problems, Outcome-Space Polyblock Approximation Algorithm for Optimizing over Efficient Sets, Monotonic grey box direct search optimization

Cites Work

• Canonical DC programming problem: Outer approximation methods revisited
• Lipschitz programming via increasing convex-along-rays functions^*
• Convex analysis and global optimization
• Unnamed Item
• Unnamed Item