Mathematical programs with vanishing constraints: critical point theory

被引:0
|
作者
Dominik Dorsch
Vladimir Shikhman
Oliver Stein
机构
[1] RWTH Aachen University,Department of Mathematics—C
[2] Karlsruhe Institute of Technology,Institute of Operations Research
来源
关键词
Mathematical programs with vanishing constraints; MPVC; T-stationarity; Stationary T-index; Morse theory; Genericity;
D O I
暂无
中图分类号
学科分类号
摘要
We study mathematical programs with vanishing constraints (MPVCs) from a topological point of view. We introduce the new concept of a T-stationary point for MPVC. Under the Linear Independence Constraint Qualification we derive an equivariant Morse Lemma at nondegenerate T-stationary points. Then, two basic theorems from Morse Theory (deformation theorem and cell-attachment theorem) are proved. Outside the T-stationary point set, continuous deformation of lower level sets can be performed. As a consequence, the topological data (such as the number of connected components) then remain invariant. However, when passing a T-stationary level, the topology of the lower level set changes via the attachment of a q-dimensional cell. The dimension q equals the stationary T-index of the (nondegenerate) T-stationary point. The stationary T-index depends on both the restricted Hessian of the Lagrangian and the number of bi-active vanishing constraints. Further, we prove that all T-stationary points are generically nondegenerate. The latter property is shown to be stable under C2-perturbations of the defining functions. Finally, some relations with other stationarity concepts, such as strong, weak, and M-stationarity, are discussed.
引用
收藏
页码:591 / 605
页数:14
相关论文
共 50 条
  • [1] Mathematical programs with vanishing constraints: critical point theory
    Dorsch, Dominik
    Shikhman, Vladimir
    Stein, Oliver
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2012, 52 (03) : 591 - 605
  • [2] On duality for mathematical programs with vanishing constraints
    Mishra, S. K.
    Singh, Vinay
    Laha, Vivek
    [J]. ANNALS OF OPERATIONS RESEARCH, 2016, 243 (1-2) : 249 - 272
  • [3] On duality for mathematical programs with vanishing constraints
    S. K. Mishra
    Vinay Singh
    Vivek Laha
    [J]. Annals of Operations Research, 2016, 243 : 249 - 272
  • [4] New dualities for mathematical programs with vanishing constraints
    Hu, Qingjie
    Wang, Jiguang
    Chen, Yu
    [J]. ANNALS OF OPERATIONS RESEARCH, 2020, 287 (01) : 233 - 255
  • [5] New dualities for mathematical programs with vanishing constraints
    Qingjie Hu
    Jiguang Wang
    Yu Chen
    [J]. Annals of Operations Research, 2020, 287 : 233 - 255
  • [6] Exact penalty results for mathematical programs with vanishing constraints
    Hoheisel, Tim
    Kanzow, Christian
    Outrata, Jiri V.
    [J]. NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 2010, 72 (05) : 2514 - 2526
  • [7] On an exact penalty result for mathematical programs with vanishing constraints
    Hu, Qingjie
    Wang, Jiguang
    Chen, Yu
    Zhu, Zhibin
    [J]. OPTIMIZATION LETTERS, 2017, 11 (03) : 641 - 653
  • [8] A smoothing-regularization approach to mathematical programs with vanishing constraints
    Achtziger, Wolfgang
    Hoheisel, Tim
    Kanzow, Christian
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2013, 55 (03) : 733 - 767
  • [9] Mathematical programs with vanishing constraints involving strongly invex functions
    Bhuwan Chandra Joshi
    [J]. Numerical Algorithms, 2022, 91 : 505 - 530
  • [10] A smoothing-regularization approach to mathematical programs with vanishing constraints
    Wolfgang Achtziger
    Tim Hoheisel
    Christian Kanzow
    [J]. Computational Optimization and Applications, 2013, 55 : 733 - 767