Convexification, concavification and monotonization in global optimization

DOI10.1023/A:1013313901854zbMath0995.90091OpenAlexW123093799WikidataQ57445533 ScholiaQ57445533MaRDI QIDQ5959334

No author found.

Publication date: 26 March 2002

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1013313901854

zbMATH Keywords

global optimizationnonconvex optimizationconvexificationconcavificationmonotonization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (12)

A survey of hidden convex optimization ⋮ Fast Gaussian kernel learning for classification tasks based on specially structured global optimization ⋮ On convexification for a class of global optimization problems ⋮ A class of convexification and concavification methods for non-monotone optimization problems ⋮ Convexification of nonsmooth monotone functions ⋮ Global descent methods for unconstrained global optimization ⋮ Convexification and concavification for a general class of global optimization problems ⋮ An exact solution method for reliability optimization in complex systems ⋮ A branch-and-bound based method for solving monotone optimization problems ⋮ Hidden convex minimization ⋮ A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs ⋮ A NOVEL MONOTONIZATION TRANSFORMATION FOR SOME CLASSES OF GLOBAL OPTIMIZATION PROBLEMS

This page was built for publication: Convexification, concavification and monotonization in global optimization