Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
Top Cited Papers
- 1 February 2000
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 25 (1) , 1-22
- https://doi.org/10.1287/moor.25.1.1.15213
Abstract
We study mathematical programs with complementarity constraints. Several stationarity concepts, based on a piecewise smooth formulation, are presented and compared. The concepts are related to stationarity conditions for certain smooth programs as well as to stationarity concepts for a nonsmooth exact penalty function. Further, we present Fiacco-McCormick type second order optimality conditions and an extension of the stability results of Robinson and Kojima to mathematical programs with complementarity constraints.Keywords
This publication has 21 references indexed in Scilit:
- Exact Penalization of Mathematical Programs with Equilibrium ConstraintsSIAM Journal on Control and Optimization, 1999
- Engineering and Economic Applications of Complementarity ProblemsSIAM Review, 1997
- An Exact Penalization Viewpoint of Constrained OptimizationSIAM Journal on Control and Optimization, 1991
- Nonlinear optimization: Characterization of structural stabilityJournal of Global Optimization, 1991
- Bilevel programming for steady-state chemical process design—I. Fundamentals and algorithmsComputers & Chemical Engineering, 1990
- Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivityPublished by Springer Nature ,1987
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable ProblemsSIAM Journal on Control and Optimization, 1983
- Some continuity properties of polyhedral multifunctionsPublished by Springer Nature ,1981
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear SystemsSIAM Journal on Numerical Analysis, 1976
- A generalization of the linear complementarity problemJournal of Combinatorial Theory, 1970