Constrained Optimization on Hierarchies and Braids of Partitions

Abstract : This theoretical paper provides a basis for the optimality of scale-sets by Guigues [6] and the optimal pruning of binary partition trees by Salembier-Garrido [11]. They extract constrained-optimal cuts from a hierarchy of partitions. Firstly, this paper extends their results to a larger family of partitions, namely the braid [9]. Secondly, the paper shows the dependence of valid constraint function values and multiplier values in a Lagrangian optimization framework. Lastly, but most importantly, it also proposes the energetic order and energetic lattice based solutions for the constraint optimization problem. This approach operates on a partition based constraint thus ensuring the existence of a valid multiplier and constraint value.
Type de document :
Pré-publication, Document de travail
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger
Contributeur : Bangalore Ravi Kiran <>
Soumis le : dimanche 22 mars 2015 - 18:00:40
Dernière modification le : lundi 12 novembre 2018 - 10:56:35
Document(s) archivé(s) le : jeudi 2 juillet 2015 - 06:17:24


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01134115, version 1


Jean Serra, Bangalore Ravi Kiran. Constrained Optimization on Hierarchies and Braids of Partitions. 2015. 〈hal-01134115〉



Consultations de la notice


Téléchargements de fichiers