Optimization Online


On the Exhaustivity of Simplicial Partitioning

Peter J.C. Dickinson (p.j.c.dickinson***at***rug.nl)

Abstract: During the last 40 years, simplicial partitioning has shown itself to be highly useful, including in the field of Nonlinear Optimisation. In this article, we consider results on the exhaustivity of simplicial partitioning schemes. We consider conjectures on this exhaustivity which seem at first glance to be true (two of which have been stated as true in published articles). However, we will provide counter examples to these conjectures. We also provide a new simplicial partitioning scheme, which provides a lot of freedom, whilst guaranteeing exhaustivity.

Keywords: Nonconvex Programming; Simplices; Partitioning; Exhaustivity

Category 1: Nonlinear Optimization (Other )

Citation: Preprint, 2012


Entry Submitted: 08/17/2012
Entry Accepted: 08/17/2012
Entry Last Modified: 02/18/2013

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society