Convexification and concavification for a general class of global optimization problems
From MaRDI portal
Publication:556003
DOI10.1007/s10898-004-0569-6zbMath1274.90284OpenAlexW2057372187MaRDI QIDQ556003
Lian-Sheng Zhang, Zhi-You Wu, Fu-Sheng Bai
Publication date: 13 June 2005
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-004-0569-6
global optimizationreverse convex programmingconcave minimizationD.C. programmingmonotone programming
Related Items (6)
A review of recent advances in global optimization ⋮ On convexification for a class of global optimization problems ⋮ A class of convexification and concavification methods for non-monotone optimization problems ⋮ Generating properly efficient points in multi-objective programs by the nonlinear weighted sum scalarization method ⋮ Global optimization of signomial mixed-integer nonlinear programming problems with free variables ⋮ A NOVEL MONOTONIZATION TRANSFORMATION FOR SOME CLASSES OF GLOBAL OPTIMIZATION PROBLEMS
Cites Work
- Unnamed Item
- Constrained global optimization: algorithms and applications
- Zero duality gap for a class of nonconvex optimization problems
- Local convexification of the Lagrangian function in nonconvex optimization
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- A method for globally minimizing concave functions over convex sets
- Deterministic algorithms for constrained concave minimization: A unified critical survey
- Convex analysis and global optimization
- Convexification of a noninferior frontier
- 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: Convexification and concavification for a general class of global optimization problems
