Volume 4, Number 3, September 2008, pp. 571-604
Dominikus Noll, Olivier Prot and Aude Rondepierre
Key words:
nonsmooth programming, nonconvex programming, bundle methods, proximity control, global convergence, H∞-synthesis
Mathematices Subject Classification: 49J52, 90C26, 90C22, 93B36
ONLINE SUBSCRIPTION (Institutional Subscription Only)
Copyright© 2008 Yokohama Publishers
Back

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 programming, 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.
A proximity control algorithm to minimize nonsmooth and nonconvex functions