Characterization of convexifiable functions

DOI10.1080/02331930600711968zbMath1124.90038OpenAlexW1967710355MaRDI QIDQ3446579

Sanjo Zlobec

Publication date: 19 June 2007

Published in: Optimization (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)

Related Items (10)

A review of recent advances in global optimization ⋮ Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains ⋮ On two simple decompositions of Lipschitz functions ⋮ A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms ⋮ Inequalities for convex functions and isotonic sublinear functionals ⋮ Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators ⋮ An elementary proof of the quadratic envelope characterization of zero-derivative points ⋮ New methods for calculating \(\alpha\)BB-type underestimators ⋮ New Kuhn-Tucker sufficiency for global optimality via convexification ⋮ An extension of Jensen's operator inequality and its application to Young inequality

Cites Work

• A remark on the GOP algorithm for global optimization
• Saddle-point optimality: a look beyond convexity
• On the Liu-Floudas convexification of smooth programs
• Strong and Weak Convexity of Sets and Functions
• Convexifiable functions in integral calculus
• On Convex Functions

This page was built for publication: Characterization of convexifiable functions