Classical and strong convexity of sublevel sets and application to attainable sets of nonlinear systems

DOI10.1137/130945983MaRDI QIDQ5173264zbMATH OpenOpenAlexFDO

Authors A. Weber, Gunther Reißig

Publication date 9 February 2015

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1311.4989

zbMATH Keywords

attainable setconvexitylocal quadratic supportstrong convexitysublevel set

Mathematics Subject Classification ID

Set-valued and variational analysis (49J53) Attainable sets, reachability (93B03) Nonlinear systems in control theory (93C10) Control/observation systems governed by ordinary differential equations (93C15)

Abstract: Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of the so-called local quadratic support is proved. The results concerning strong convexity are used to derive sufficient conditions for attainable sets of continuous-time nonlinear systems to be strongly convex. An application of these conditions is a novel method to over-approximate attainable sets when strong convexity is present.

Recommendations

• Strong convexity of reachable sets of linear systems
• Convexity of reachable sets of nonlinear ordinary differential equations
• scientific article; zbMATH DE number 971320
• scientific article; zbMATH DE number 4002916
• scientific article; zbMATH DE number 2075193

Cited in

(2)

• On the convexity of piecewise-defined functions
• Convexity of reachable sets of nonlinear ordinary differential equations

This page was built for publication: Classical and strong convexity of sublevel sets and application to attainable sets of nonlinear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5173264)