It is usually not known in advance whether a nonlinear set of constraints has zero, one, or multiple feasible regions. Further, if one or more feasible regions exist, their locations are usually unknown. We propose a method for exploring the variable space quickly, using constraint consensus (CC) to identify promising areas that may contain a feasible region. Multiple CC solution points are clustered to identify regions of attraction. A new inter-point distance frequency distribution technique is used to determine the critical distance for the single-linkage clustering algorithm, which in turn determines the estimated number of disjoint feasible regions. The effectiveness of multistart global optimization is increased due to better exploration of the variable space, and efficiency is also increased because the expensive local solver is launched just once near each identified feasible region. The method is demonstrated on a variety of highly nonlinear models.

Additional Metadata
Keywords clustering, concentration, constraint consensus, disjoint feasible regions, nonlinear constrained global optimization
Persistent URL dx.doi.org/10.1080/10556788.2011.647818
Journal Optimization Methods and Software
Citation
Smith, L. (Laurence), Chinneck, J, & Aitken, V. (Victor). (2013). Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes. Optimization Methods and Software, 28(2), 339–363. doi:10.1080/10556788.2011.647818