Work

How to Compute a M-stationary point of the MPCC

Year: 2017

Type: preprint

Abstract: We discuss here the convergence of relaxation methods for MPCC with approximate sequence of stationary points by presenting a general framework to study these methods. It has been pointed out in the literature, [25], that relaxation methods with approximate stationary points fail to give guarantee of convergence. We show that by dening a new strong approximate stationarity we can attain the desired goal of computing an M-stationary point. We also provide an algorithmic strategy to compute such point. Existence of strong approximate stationary point in the neighborhood of an M-stationary point is proved.

Source: HAL

DOI: 10.60692/jebdb-nf904

Authors: Jean-Pièrre Dussault, Mounir Haddou, Abdeslam Kadrani, Tangi Migot

Institutions: Université de Sherbrooke, Département d'Informatique, Institut National des Sciences Appliquées de Rennes, Institut National de Statistique et d'Economie Appliquée, Institut de recherche mathématique de Rennes

Language: English

Topic: Optimization and Variational Analysis

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2745189180

Cites:

Cited by: 3

Related to: 10