Lipschitz behavior of the robust regularization
Adrian S. Lewis(aslewisorie.cornell.edu)
Abstract: To minimize or upper-bound the value of a function ``robustly'', we might instead minimize or upper-bound the ``epsilon-robust regularization'', defined as the map from a point to the maximum value of the function within an epsilon-radius. This regularization may be easy to compute: convex quadratics lead to semidefinite-representable regularizations, for example, and the spectral radius of a matrix leads to pseudospectral computations. For favorable classes of functions, we show that the robust regularization is Lipschitz around any given point, for all small epsilon > 0, even if the original function is nonlipschitz (like the spectral radius). One such favorable class consists of the semi-algebraic functions. Such functions have graphs that are finite unions of sets defined by finitely-many polynomial inequalities, and are commonly encountered in applications.
Keywords: robust optimization, nonsmooth analysis, locally Lipschitz, regularization, semi-algebraic, pseudospectrum, robust control, semidefinite representable, prox-regularity.
Category 1: Robust Optimization
Category 2: Convex and Nonsmooth Optimization (Nonsmooth Optimization )
Category 3: Applications -- Science and Engineering (Control Applications )
Entry Submitted: 10/01/2008
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|