English

Optimality conditions for mathematical programs with orthogonality type constraints

Optimization and Control 2021-10-25 v1

Abstract

We consider the class of mathematical programs with orthogonality type constraints (MPOC). Orthogonality type constraints appear by reformulating the sparsity constraint via auxiliary binary variables and relaxing them afterwards. For MPOC a necessary optimality condition in terms of T-stationarity is stated. The justification of T-stationarity is threefold. First, it allows to capture the global structure of MPOC in terms of Morse theory, i. e. deformation and cell-attachment results are established. For that, nondegeneracy for the T-stationary points is introduced and shown to hold at a generic MPOC. Second, we prove that Karush-Kuhn-Tucker points of the Scholtes-type regularization converge to T-stationary points of MPOC. This is done under the MPOC-tailored linear independence constraint qualification (LICQ), which turns out to be a generic property too. Third, we show that T-stationarity applied to the relaxation of sparsity constrained nonlinear optimization (SCNO) naturally leads to its M-stationary points. Moreover, we argue that all T-stationary points of this relaxation become degenerate.

Keywords

Cite

@article{arxiv.2110.11793,
  title  = {Optimality conditions for mathematical programs with orthogonality type constraints},
  author = {Sebastian Lämmel and Vladimir Shikhman},
  journal= {arXiv preprint arXiv:2110.11793},
  year   = {2021}
}

Comments

23 pages. arXiv admin note: text overlap with arXiv:2012.02438, arXiv:2106.08083

R2 v1 2026-06-24T07:06:23.913Z