A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems

被引:6
作者
Lu, Yue [1 ]
Huang, Ming [2 ]
Zhang, Yi [3 ]
Gu, Jian [4 ]
机构
[1] Tianjin Normal Univ, Sch Math Sci, Tianjin, Peoples R China
[2] Dalian Maritime Univ, Dept Math, Dalian, Peoples R China
[3] East China Univ Sci & Technol, Sch Sci, Dept Math, Shanghai, Peoples R China
[4] Dalian Ocean Univ, Sch Sci, Dalian, Peoples R China
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Sparse inverse semidefinite quadratic programming problems; alternating direction method of multiplier; Kurdyka-Lojasiewicz inequality; iteration-complexity; ALTERNATING DIRECTION METHOD; COMBINATORIAL OPTIMIZATION; DESCENT METHODS; CONVERGENCE; MINIMIZATION; ALGORITHMS;
D O I
10.1080/02331934.2019.1576663
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we consider a class of sparse inverse semidefinite quadratic programming problems, in which a nonconvex alternating direction method of multiplier is investigated. Under mild conditions, we establish convergence results of our algorithm and the corresponding non-ergodic iteration-complexity is also considered under the assumption that the potential function satisfies the famous Kurdyka-Lojasiewicz property. Numerical results show that our algorithm is suitable to solve the given sparse inverse semidefinite quadratic programming problems.
引用
收藏
页码:1075 / 1105
页数:31
相关论文
共 50 条
  • [31] SECOND ORDER OPTIMALITY CONDITIONS AND REFORMULATIONS FOR NONCONVEX QUADRATICALLY CONSTRAINED QUADRATIC PROGRAMMING PROBLEMS
    Shi, Ziye
    Jin, Qingwei
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2014, 10 (03) : 871 - 882
  • [32] An extended proximal ADMM algorithm for three-block nonconvex optimization problems
    Zhang, Chun
    Song, Yongzhong
    Cai, Xingju
    Han, Deren
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2021, 398 (398)
  • [33] A fast algorithm for nonconvex approaches to sparse recovery problems
    Montefusco, Laura B.
    Lazzaro, Damiana
    Papi, Serena
    SIGNAL PROCESSING, 2013, 93 (09) : 2636 - 2647
  • [34] Peaceman-Rachford splitting for a class of nonconvex optimization problems
    Li, Guoyin
    Liu, Tianxiang
    Pong, Ting Kei
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2017, 68 (02) : 407 - 436
  • [35] A novel neural network model for solving a class of nonlinear semidefinite programming problems
    Nikseresht, Asiye
    Nazemi, Alireza
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2018, 338 : 69 - 79
  • [36] Positive Semidefinite Generalized Diffusion Tensor Imaging via Quadratic Semidefinite Programming
    Chen, Yannan
    Dai, Yuhong
    Han, Deren
    Sun, Wenyu
    SIAM JOURNAL ON IMAGING SCIENCES, 2013, 6 (03): : 1531 - 1552
  • [37] A Perturbation approach for an inverse quadratic programming problem
    Zhang, Jianzhong
    Zhang, Liwei
    Xiao, Xiantao
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2010, 72 (03) : 379 - 404
  • [38] A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs
    Yamakawa, Yuya
    Okuno, Takayuki
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2022, 83 (03) : 1027 - 1064
  • [39] Relax-and-split method for nonconvex inverse problems
    Zheng, Peng
    Aravkin, Aleksandr
    INVERSE PROBLEMS, 2020, 36 (09)
  • [40] On a class of nonconvex equilibrium problems
    Noor, MA
    APPLIED MATHEMATICS AND COMPUTATION, 2004, 157 (03) : 653 - 666