Sensitivity Analysis for Cone-Constrained Optimization Problems Under the Relaxed Constraint Qualifications
- 1 May 2005
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 30 (2) , 333-353
Abstract
We present the local sensitivity analysis for cone-constrained optimization problems under the CQ-type conditions significantly weaker than those traditionally used in this context. Our basic sensitivity results are established under the first or second-order sufficient optimality conditions combined with the estimate of the distance to the feasible set of the perturbed problem. We demonstrate how such an estimate can be obtained under the assumptions weaker than Robinson’s CQ, and establish the corresponding sensitivity results. Finally, we apply our results to sensitivity analysis and relaxation schemes for mathematical programs with complementarity constraints.Keywords
This publication has 17 references indexed in Scilit:
- Abnormal equality-constrained optimization problems: sensitivity theoryMathematical Programming, 2004
- The Theory of 2-Regularity for Mappings with Lipschitzian Derivatives and its Applications to Optimality ConditionsMathematics of Operations Research, 2002
- Optimality Conditions for Irregular Inequality-Constrained ProblemsSIAM Journal on Control and Optimization, 2002
- Error bounds for 2-regular mappings with Lipschitzian derivatives and their applicationsMathematical Programming, 2001
- Perturbation Analysis of Optimization Problems2000
- Theorems on the representation of nonlinear mapping families and implicit function theoremsMathematical Notes, 2000
- Optimality Conditions: Abnormal and Degenerate Problems2000
- Optimization Problems with Perturbations: A Guided TourSIAM Review, 1998
- Properties of quadratic maps in a Banach spaceMathematical Notes, 1991
- Theorems on estimates in the neighborhood of a singular point of a mappingMathematical Notes, 1990