Global aspects of the continuous reformulation for cardinality-constrained optimization problems

被引:1
|
作者
Laemmel, S. [1 ]
Shikhman, V. [1 ]
机构
[1] Tech Univ Chemnitz, Dept Math, Chemnitz, Germany
关键词
Cardinality-constrained optimization problem; continuous reformulation; non-degenerate stationarity; index; genericity; MATHEMATICAL PROGRAMS; CONVERGENCE;
D O I
10.1080/02331934.2023.2249014
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The main goal of this paper is to relate the topologically relevant stationary points of a cardinality-constrained optimization problem and its continuous reformulation up to their type. For that, we focus on the non-degenerate M- and T-stationary points, respectively. Their M-index and T-index, respectively, which uniquely determine the global and local structure of optimization problems under consideration in algebraic terms, are traced. As novelty, we suggest to regularize the continuous reformulation for this purpose. The main consequence of our analysis is that the number of saddle points of the regularized continuous reformulation grows exponentially as compared to that of the initial cardinality-constrained optimization problem. This growth appears to be inherent and is reproduced in other relaxation attempts.
引用
收藏
页码:3185 / 3208
页数:24
相关论文
共 50 条
  • [1] An Augmented Lagrangian Method for Cardinality-Constrained Optimization Problems
    Christian Kanzow
    Andreas B. Raharja
    Alexandra Schwartz
    Journal of Optimization Theory and Applications, 2021, 189 : 793 - 813
  • [2] An Augmented Lagrangian Method for Cardinality-Constrained Optimization Problems
    Kanzow, Christian
    Raharja, Andreas B.
    Schwartz, Alexandra
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2021, 189 (03) : 793 - 813
  • [3] Sequential optimality conditions for cardinality-constrained optimization problems with applications
    Kanzow, Christian
    Raharja, Andreas B.
    Schwartz, Alexandra
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2021, 80 (01) : 185 - 211
  • [4] Sequential optimality conditions for cardinality-constrained optimization problems with applications
    Christian Kanzow
    Andreas B. Raharja
    Alexandra Schwartz
    Computational Optimization and Applications, 2021, 80 : 185 - 211
  • [5] A strong sequential optimality condition for cardinality-constrained optimization problems
    Menglong Xue
    Liping Pang
    Numerical Algorithms, 2023, 92 : 1875 - 1904
  • [6] A strong sequential optimality condition for cardinality-constrained optimization problems
    Xue, Menglong
    Pang, Liping
    NUMERICAL ALGORITHMS, 2023, 92 (03) : 1875 - 1904
  • [7] Algorithm for cardinality-constrained quadratic optimization
    Bertsimas, Dimitris
    Shioda, Romy
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2009, 43 (01) : 1 - 22
  • [8] Algorithm for cardinality-constrained quadratic optimization
    Dimitris Bertsimas
    Romy Shioda
    Computational Optimization and Applications, 2009, 43 : 1 - 22
  • [9] Tight SDP Relaxations for Cardinality-Constrained Problems
    Wiegele, Angelika
    Zhao, Shudian
    OPERATIONS RESEARCH PROCEEDINGS 2021, 2022, : 167 - 172
  • [10] An Artificial Bee Colony Algorithm for the Cardinality-Constrained Portfolio Optimization Problems
    Chen, Angela H. L.
    Liang, Yun-Chia
    Liu, Chia-Chien
    2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2012,