A branch-and-bound based method for solving monotone optimization problems

DOI10.1007/s10898-005-3843-3zbMath1097.90056OpenAlexW2032318751MaRDI QIDQ2501119

Yanyan Li

Publication date: 4 September 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-005-3843-3

zbMATH Keywords

partitionglobal optimizationlocal searchconvexificationmonotone optimizationbranch-and-bound method

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization

Cites Work

• Convexification of nonsmooth monotone functions
• An exact solution method for reliability optimization in complex systems
• A nonlinear knapsack problem
• Monotonic Optimization: Problems and Solution Approaches
• An alogrithm for monotonic global optimization problems^∗
• Algorithms for Separable Nonlinear Resource Allocation Problems
• Optimization of system reliability: a survey of problems and techniques†
• A method for globally minimizing concave functions over convex sets
• An Improved Algorithm for Network Reliability
• Deterministic algorithms for constrained concave minimization: A unified critical survey
• Solving Bicriterion Mathematical Programs
• A new approach to optimization under monotonic constraint
• A convexification method for a class of global optimization problems with applications to reliability optimization
• Convexification, concavification and monotonization in global optimization

This page was built for publication: A branch-and-bound based method for solving monotone optimization problems