| List of Symbols | p. xi |
| List of Figures | p. xv |
| List of Tables | p. xix |
| Preface | p. xxi |
| Acknowledgments | p. xxvii |
| Introduction | p. 1 |
| Standard semi-infinite programming | p. 2 |
| General semi-infinite programming | p. 4 |
| The misconception about the generality of GSIP | p. 6 |
| Development to a field of active research | p. 8 |
| Examples and Applications | p. 11 |
| Chebyshev and reverse Chebyshev approximation | p. 12 |
| Minimax problems | p. 14 |
| Robust optimization | p. 15 |
| Design centering | p. 18 |
| Defect minimization for operator equations | p. 20 |
| Disjunctive programming | p. 22 |
| Topological Structure of the Feasible Set | p. 25 |
| Abstract index set mappings | p. 25 |
| A projection formula | p. 27 |
| A bi-level formula and semi-continuity properties | p. 31 |
| A set-valued mapping formula | p. 41 |
| The local structure of M | p. 42 |
| The completely convex case | p. 44 |
| Index set mappings with functional constraints | p. 46 |
| The convex case | p. 46 |
| The linear case | p. 47 |
| The C[superscript 1] case | p. 60 |
| The C[superscript 2] case | p. 62 |
| Genericity results | p. 66 |
| Optimality Conditions | p. 85 |
| Abstract primal optimality conditions | p. 85 |
| First order approximations of the feasible set | p. 90 |
| General constraint qualifications | p. 91 |
| Descriptions of the linearization cones | p. 96 |
| Degenerate index sets | p. 108 |
| Dual first order optimality conditions | p. 116 |
| The standard semi-infinite case | p. 118 |
| The completely convex case | p. 120 |
| The convex case | p. 123 |
| The C[superscript 2] case with Reduction Ansatz | p. 126 |
| The C[superscript 1] case | p. 128 |
| Second order optimality conditions | p. 142 |
| Bi-Level Methods for GSIP | p. 145 |
| Reformulations of GSIP | p. 146 |
| The Stackelberg game reformulation of GSIP | p. 146 |
| The MPEC reformulation of GSIP | p. 148 |
| A regularization of MPEC by NCP functions | p. 149 |
| The regularized Stackelberg game | p. 152 |
| Convergence results for a bi-level method | p. 154 |
| A parametric reduction lemma | p. 155 |
| Convergence of global solutions | p. 157 |
| Convergence of Fritz John points | p. 158 |
| Quadratic convergence of the optimal values | p. 162 |
| An outer approximation property | p. 163 |
| Other bi-level approaches and generalizations | p. 167 |
| Computational Results | p. 171 |
| Design centering in two dimensions | p. 172 |
| Design centering in higher dimensions | p. 177 |
| Robust optimization | p. 178 |
| Optimal error bounds for an elliptic operator equation | p. 181 |
| Final Remarks | p. 187 |
| References | p. 191 |
| Index | p. 201 |
| Table of Contents provided by Ingram. All Rights Reserved. |