A New Class of Improved Convex Underestimators for Twice Continuously Differentiable Constrained NLPs

  • Authors:

  • Ioannis G. Akrotirianakis;Christodoulos A. Floudas

  • Affiliations:

  • Department of Chemical Engineering, Princeton University, Princeton, USA 08540;Department of Chemical Engineering, Princeton University, Princeton, USA 08540

  • Venue:
  • Journal of Global Optimization
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new class of convex underestimators for arbitrarily nonconvex and twice continuously differentiable functions. The underestimators are derived by augmenting the original nonconvex function by a nonlinear relaxation function. The relaxation function is a separable convex function, that involves the sum of univariate parametric exponential functions. An efficient procedure that finds the appropriate values for those parameters is developed. This procedure uses interval arithmetic extensively in order to verify whether the new underestimator is convex. For arbitrarily nonconvex functions it is shown that these convex underestimators are tighter than those generated by the 驴BB method. Computational studies complemented with geometrical interpretations demonstrate the potential benefits of the proposed improved convex underestimators.