4.5 Article

On the Liu-Floudas convexification of smooth programs

Journal

JOURNAL OF GLOBAL OPTIMIZATION
Volume 32, Issue 3, Pages 401-407

Publisher

SPRINGER
DOI: 10.1007/s10898-004-3134-4

Keywords

global optimum; convexification; Lipschitz continuously differentiable function

Ask authors/readers for more resources

It is well known that a twice continuously differentiable function can be convexified by a simple quadratic term. Here we show that the convexification is possible also for every Lipschitz continuously differentiable function. This implies that the Liu-Floudas convexification works for, loosely speaking, almost every smooth program occurring in practice.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available