A Proximity Control Algorithm to Minimize Nonsmooth and Nonconvex Functions

Abstract : We present a new proximity control bundle algorithm to minimize nonsmooth and nonconvex locally Lipschitz functions. In contrast with the traditional oracle-based methods in nonsmooth program- ming, our method is model-based and can accommodate cases where several Clarke subgradients can be computed at reasonable cost. We propose a new way to manage the proximity control parameter, which allows us to handle nonconvex objectives. We prove global convergence of our method in the sense that every accumulation point of the sequence of serious steps is critical. Our method is tested on a variety of examples in H∞-controller synthesis.
Type de document :
Article dans une revue
Liste complète des métadonnées

Littérature citée [28 références]  Voir  Masquer  Télécharger

Contributeur : Yolande Vieceli <>
Soumis le : lundi 4 juin 2018 - 14:46:55
Dernière modification le : lundi 29 avril 2019 - 17:04:21
Document(s) archivé(s) le : mercredi 26 septembre 2018 - 13:44:04


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


  • HAL Id : hal-00464695, version 1


Dominikus Noll, Olivier Prot, Aude Rondepierre. A Proximity Control Algorithm to Minimize Nonsmooth and Nonconvex Functions. Pacific journal of optimization, Yokohama Publishers, 2008, 4 (3), pp.571-604. ⟨http://www.ybook.co.jp/online2/oppjo/vol4/p571.html⟩. ⟨hal-00464695⟩



Consultations de la notice


Téléchargements de fichiers