The C-Index: A New Stability Concept for Quadratic Programs with Complementarity Constraints

Authors:
Daniel Ralph;Oliver Stein
Affiliations:
Judge Business School, University of Cambridge, Cambridge CB2 1AG, United Kingdom;Karlsruhe Institute of Technology, 76128 Karlsruhe, Germany
Venue:
Mathematics of Operations Research
Year:
2011

Citing 22
Cited 0

Critical sets in parametric optimization

Mathematical Programming: Series A and B
Numerical continuation methods: an introduction

Numerical continuation methods: an introduction
Exact Penalization of Mathematical Programs with Equilibrium Constraints

SIAM Journal on Control and Optimization
QPECgen, a MATLAB Generator for Mathematical Programs with Quadratic Objectives and Affine Variational Inequality Constraints

Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part II
Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity

Mathematics of Operations Research
How Stringent Is the Linear Independence Assumption for Mathematical Programs with Complementarity Constraints?

Mathematics of Operations Research
Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints

SIAM Journal on Optimization
An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints

SIAM Journal on Optimization
A New Extreme Point Algorithm and Its Application in PSQP Algorithms for Solving Mathematical Programs with Linear Complementarity Constraints

Journal of Global Optimization
Extension of Quasi-Newton Methods to Mathematical Programs with Complementarity Constraints

Computational Optimization and Applications
BI-Level Strategies in Semi-Infinite Programming

BI-Level Strategies in Semi-Infinite Programming
An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)

SIAM Journal on Optimization
On Using the Elastic Mode in Nonlinear Programming Approaches to Mathematical Programs with Complementarity Constraints

SIAM Journal on Optimization
A Robust SQP Method for Mathematical Programs with Linear Complementarity Constraints

Computational Optimization and Applications
Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints

SIAM Journal on Optimization
Interior-Point Algorithms, Penalty Methods and Equilibrium Problems

Computational Optimization and Applications
Nonlinear Optimization in Finite Dimensions - Morse Theory, Chebyshev Approximation, Transversality, Flows, Parametric Aspects (Nonconvex Optimization and its Applications Volume 47)

Nonlinear Optimization in Finite Dimensions - Morse Theory, Chebyshev Approximation, Transversality, Flows, Parametric Aspects (Nonconvex Optimization and its Applications Volume 47)
Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties

Mathematical Programming: Series A and B
Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs

Mathematical Programming: Series A and B
MPCC: Critical Point Theory

SIAM Journal on Optimization
Lifting mathematical programs with complementarity constraints

Mathematical Programming: Series A and B
Characterization of strong stability for C-stationary points in MPCC

Mathematical Programming: Series A and B

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce nondegeneracy and the C-index for C-stationary points of a QPCC, that is, for a mathematical program with a quadratic objective function and linear complementarity constraints. The C-index characterizes the qualitative local behavior of a QPCC around a nondegenerate C-stationary point. The article focuses on the structure of the C-stationary set of QPCCs depending on a real parameter. We show that, for generic QPCC data, the C-index changes exactly at turning points of the C-stationary set, and that it changes by exactly one. To illustrate this concept, we introduce and analyze two homotopy methods for finding C-stationary points. Numerical results illustrate that, for randomly generated test problems, the two homotopy methods very often identify B-stationary points.