A class of convexification and concavification methods for non-monotone optimization problems

DOI10.1080/02331930500342807zbMath1147.90400OpenAlexW2014157826MaRDI QIDQ3534647

Yang, Xinmin, H. W. Joseph Lee, Zhi-You Wu

Publication date: 4 November 2008

Published in: Optimization (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Newton-type methods (49M15)

Related Items (2)

A review of recent advances in global optimization ⋮ On convexification for a class of global optimization problems

Cites Work

• Convexification and concavification for a general class of global optimization problems
• An exact solution method for reliability optimization in complex systems
• Monotonic Optimization: Problems and Solution Approaches
• A method for globally minimizing concave functions over convex sets
• Deterministic algorithms for constrained concave minimization: A unified critical survey
• 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 class of convexification and concavification methods for non-monotone optimization problems