Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T12:40:37.382Z Has data issue: false hasContentIssue false

Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint

Published online by Cambridge University Press:  08 November 2006

Hoai An Le Thi
Affiliation:
Laboratoire de l'Informatique Théorique et Appliquée, UFR Scientifique MIM Université Paul Verlaine – Metz, Ile du Saulcy, 57045 Metz, France; lethi@univ-metz.fr
Mohand Ouanes
Affiliation:
Laboratoire de l'Informatique Théorique et Appliquée, UFR Scientifique MIM Université Paul Verlaine – Metz, Ile du Saulcy, 57045 Metz, France; lethi@univ-metz.frDépartement de Mathématiques, Faculté des Sciences, Université de Tizi-Ouzou, Algeria.
Get access

Abstract

The purpose of this paper is to demonstrate that, for globally minimize one dimensional nonconvex problems withboth twice differentiable function and constraint, we can propose an efficientalgorithm based on Branch and Bound techniques. The method is firstdisplayed in the simple case with an interval constraint. The extension is displayedafterwards to the general case with an additional nonconvex twicedifferentiable constraint. A quadratic bounding function which is betterthan the well known linear underestimator is proposed while w-subdivision is added to support the branching procedure. Computational results on several andvarious types of functions show the efficiency of our algorithms and theirsuperiority with respect to the existing methods.

Information

Type
Research Article
Copyright
© EDP Sciences, 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable