| |
| |
| List of Symbols | |
| |
| |
| List of Figures | |
| |
| |
| List of Tables | |
| |
| |
| Preface | |
| |
| |
| Acknowledgments | |
| |
| |
| |
| Introduction | |
| |
| |
| |
| Standard semi-infinite programming | |
| |
| |
| |
| General semi-infinite programming | |
| |
| |
| |
| The misconception about the generality of GSIP | |
| |
| |
| |
| Development to a field of active research | |
| |
| |
| |
| Examples and Applications | |
| |
| |
| |
| Chebyshev and reverse Chebyshev approximation | |
| |
| |
| |
| Minimax problems | |
| |
| |
| |
| Robust optimization | |
| |
| |
| |
| Design centering | |
| |
| |
| |
| Defect minimization for operator equations | |
| |
| |
| |
| Disjunctive programming | |
| |
| |
| |
| Topological Structure of the Feasible Set | |
| |
| |
| |
| Abstract index set mappings | |
| |
| |
| |
| A projection formula | |
| |
| |
| |
| A bi-level formula and semi-continuity properties | |
| |
| |
| |
| A set-valued mapping formula | |
| |
| |
| |
| The local structure of M | |
| |
| |
| |
| The completely convex case | |
| |
| |
| |
| Index set mappings with functional constraints | |
| |
| |
| |
| The convex case | |
| |
| |
| |
| The linear case | |
| |
| |
| |
| The C[superscript 1] case | |
| |
| |
| |
| The C[superscript 2] case | |
| |
| |
| |
| Genericity results | |
| |
| |
| |
| Optimality Conditions | |
| |
| |
| |
| Abstract primal optimality conditions | |
| |
| |
| |
| First order approximations of the feasible set | |
| |
| |
| |
| General constraint qualifications | |
| |
| |
| |
| Descriptions of the linearization cones | |
| |
| |
| |
| Degenerate index sets | |
| |
| |
| |
| Dual first order optimality conditions | |
| |
| |
| |
| The standard semi-infinite case | |
| |
| |
| |
| The completely convex case | |
| |
| |
| |
| The convex case | |
| |
| |
| |
| The C[superscript 2] case with Reduction Ansatz | |
| |
| |
| |
| The C[superscript 1] case | |
| |
| |
| |
| Second order optimality conditions | |
| |
| |
| |
| Bi-Level Methods for GSIP | |
| |
| |
| |
| Reformulations of GSIP | |
| |
| |
| |
| The Stackelberg game reformulation of GSIP | |
| |
| |
| |
| The MPEC reformulation of GSIP | |
| |
| |
| |
| A regularization of MPEC by NCP functions | |
| |
| |
| |
| The regularized Stackelberg game | |
| |
| |
| |
| Convergence results for a bi-level method | |
| |
| |
| |
| A parametric reduction lemma | |
| |
| |
| |
| Convergence of global solutions | |
| |
| |
| |
| Convergence of Fritz John points | |
| |
| |
| |
| Quadratic convergence of the optimal values | |
| |
| |
| |
| An outer approximation property | |
| |
| |
| |
| Other bi-level approaches and generalizations | |
| |
| |
| |
| Computational Results | |
| |
| |
| |
| Design centering in two dimensions | |
| |
| |
| |
| Design centering in higher dimensions | |
| |
| |
| |
| Robust optimization | |
| |
| |
| |
| Optimal error bounds for an elliptic operator equation | |
| |
| |
| |
| Final Remarks | |
| |
| |
| References | |
| |
| |
| Index | |