Appendix A

A.1 Notation and Basic Definitions

A set upper A is a unordered collection of elements. It can contain finitely many elements or infinitely many elements. The number of elements in a set upper A is called its cardinality, and it is denoted by StartAbsoluteValue upper A EndAbsoluteValue. For two sets upper A and upper B, the union of upper A and upper B is upper A union upper B equals StartSet x vertical-bar x element-of upper A or x element-of upper B EndSet, and the intersection of upper A and upper B is upper A intersection upper B equals StartSet x vertical-bar x element-of upper A and x element-of upper B EndSet. The set difference between two sets and is .

For two sets and , the Cartesian ...

Get Optimization for Learning and Control now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.