On the Liu-Floudas convexification of smooth programs

DOI10.1007/s10898-004-3134-4zbMath1149.90409OpenAlexW2047093656MaRDI QIDQ2494288

Sanjo Zlobec

Publication date: 26 June 2006

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

Full work available at URL: https://doi.org/10.1007/s10898-004-3134-4

zbMATH Keywords

convexificationGlobal optimumLipschitz continuously differentiable function

Mathematics Subject Classification ID

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

Related Items (8)

Characterization of convexifiable functions ⋮ A review of recent advances in global optimization ⋮ On two simple decompositions of Lipschitz functions ⋮ A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms ⋮ Convergence rate of McCormick relaxations ⋮ Exact solution of emerging quadratic assignment problems ⋮ Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications ⋮ Convexification for data fitting

Cites Work

• A remark on the GOP algorithm for global optimization
• Saddle-point optimality: a look beyond convexity

This page was built for publication: On the Liu-Floudas convexification of smooth programs