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 条
  • [21] Extended convergence analysis of the Scholtes-type regularization for cardinality-constrained optimization problems
    Laemmel, Sebastian
    Shikhman, Vladimir
    MATHEMATICAL PROGRAMMING, 2024,
  • [22] Cardinality-Constrained Texture Filtering
    Manson, Josiah
    Schaefer, Scott
    ACM TRANSACTIONS ON GRAPHICS, 2013, 32 (04):
  • [23] Global optimization for cardinality-constrained minimum sum-of-squares clustering via semidefinite programming
    Piccialli, Veronica
    Sudoso, Antonio M.
    MATHEMATICAL PROGRAMMING, 2023,
  • [24] An efficient optimization approach for a cardinality-constrained index tracking problem
    Xu, Fengmin
    Lu, Zhaosong
    Xu, Zongben
    OPTIMIZATION METHODS & SOFTWARE, 2016, 31 (02): : 258 - 271
  • [25] A memetic algorithm for cardinality-constrained portfolio optimization with transaction costs
    Ruiz-Torrubiano, Ruben
    Suarez, Alberto
    APPLIED SOFT COMPUTING, 2015, 36 : 125 - 142
  • [26] Convergent Inexact Penalty Decomposition Methods for Cardinality-Constrained Problems
    Matteo Lapucci
    Tommaso Levato
    Marco Sciandrone
    Journal of Optimization Theory and Applications, 2021, 188 : 473 - 496
  • [27] Cardinality-constrained portfolio selection based on collaborative neurodynamic optimization
    Leung, Man-Fai
    Wang, Jun
    NEURAL NETWORKS, 2022, 145 : 68 - 79
  • [28] Projected gradient descent method for cardinality-constrained portfolio optimization
    Li, Xiao-Peng
    Shi, Zhang-Lei
    Leung, Chi-Sing
    So, Hing Cheung
    JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 2024, 361 (18):
  • [29] Cardinality-constrained risk parity portfolios
    Anis, Hassan T.
    Kwon, Roy H.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 302 (01) : 392 - 402
  • [30] An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems
    Costa, Carina Moreira
    Kreber, Dennis
    Schmidt, Martin
    INFORMS JOURNAL ON COMPUTING, 2022, 34 (06) : 2968 - 2988