## Mathematical Programming with Data PerturbationsPresents research contributions and tutorial expositions on current methodologies for sensitivity, stability and approximation analyses of mathematical programming and related problem structures involving parameters. The text features up-to-date findings on important topics, covering such areas as the effect of perturbations on the performance of algorithms, approximation techniques for optimal control problems, and global error bounds for convex inequalities. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Discretization and MeshIndependence of Newtons Method for Generalized | 1 |

Extended Quadratic Tangent Optimization Prohlems | 31 |

On Generalized Differentiahility of Optimal Solutions in Nonlinear Parametric | 47 |

Dempe | 61 |

Contributors | 65 |

On Second Order Sufficient Conditions for Structured Nonlinear Programs | 83 |

Algorithmic Stahility Analysis for Certain Trust Region Methods | 109 |

A Note on Using Linear Knowledge to Solve Efficiently Linear Programs | 133 |

Convergence of Approximations to Nonlinear Optimal Control Prohlems | 253 |

Rydhei Nozawa Department of Mathematics School of Medicine Sapporo Medical | 285 |

A PerturhationBased Duality Classification for MaxFlow MinCut Prohlems | 286 |

Central and Peripheral Results in the Study of Marginal and performance | 305 |

JeanPaul Penot Lahoratoire de Mathematiques Appliquees URA Pau France | 306 |

A Tutorial | 339 |

E Schochetman Department of Mathematical Sciences Oakland University | 363 |

Solution Existence for Infinite Quadratic Programming | 365 |

Sharon Filipowski The Boeing Company Seattle Washington | 158 |

On the Role of the MangasarianFromovitz Constraint Qualification | 159 |

Hoffmans Error Bound for Systems of Convex Inequalities | 185 |

Lipschitzian and pseudoLipschitzian Inverse Functions and Applications | 201 |

On WellPosedness and Stahility Analysis in Optimization | 223 |

### Common terms and phrases

actual instance ahove algorithm applied assume assumption asymptotically Banach spaces complementarity cone consider constraint matrix constraint qualification convergence Convex Analysis convex functions convex set Corollary defined hy denote hy differentiahle directional derivative duality EMFCQ emhedding equations equivalent error hound example exists feasihle set finite dimensional function given hy glohal gphty gradient heen Hence hetween holds hoth houndary implies inequality Lagrange multiplier Lemma linear knowledge linear programs linearly independent Lipschitz continuous lower semicontinuous Math Mathematical Programming method minimizer multifunction neighhorhood nonempty nonlinear programming norm numher ohtain optimal control optimal control prohlems optimal solution optimization prohlems parametric polyhedral programming prohlems proof Proposition pseudo-regular quadratic quadratic growth Rohinson S(WQ satisfied second-order sequence SIAM sparsity knowledge stahility stationary point strong regularity sufficient conditions suhset suhspace Suppose Theorem 3.1 topological trust region upper-Lipschitz variahles vector well-posed well-posedness zero