A Euclidean distance matrix model for protein molecular conformation

被引:4
|
作者
Zhai, Fengzhen [1 ]
Li, Qingna [2 ]
机构
[1] Beijing Inst Technol, Sch Math & Stat, Beijing 100081, Peoples R China
[2] Beijing Inst Technol, Sch Math & Stat, Beijing Key Lab MCAACI, Beijing 100081, Peoples R China
基金
中国国家自然科学基金;
关键词
Protein molecular conformation; Euclidean distance matrix; Accelerated block coordinate descent method; Majorized penalty approach; ALGORITHM; GEOMETRY; LOCALIZATION; OPTIMIZATION; PROGRAMS;
D O I
10.1007/s10898-019-00771-4
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Protein molecular conformation is an important and challenging problem in biophysics. It is to recover the structure of proteins based on limited information such as noised distances, lower and upper bounds on some distances between atoms. In this paper, based on the recent progress in numerical algorithms for Euclidean distance matrix (EDM) optimization problems, we propose a EDM model for protein molecular conformation. We reformulate the problem as a rank-constrained least squares problem with linear equality constraints, box constraints, as well as a cone constraint. Due to the nonconvexity of the problem, we develop a majorized penalty approach to solve the problem. We apply the accelerated block coordinate descent algorithm proposed in Sun et al. (SIAM J Optim 26(2):1072-1100, 2016) to solve the resulting subproblem. Extensive numerical results demonstrate the efficiency of the proposed model.
引用
收藏
页码:709 / 728
页数:20
相关论文
共 50 条
  • [1] A Euclidean distance matrix model for protein molecular conformation
    Fengzhen Zhai
    Qingna Li
    Journal of Global Optimization, 2020, 76 : 709 - 728
  • [2] A Euclidean Distance Matrix Model for Convex Clustering
    Wang, Z. W.
    Liu, X. W.
    Li, Q. N.
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2025, 205 (01)
  • [3] Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints
    Lu, Si-Tong
    Zhang, Miao
    Li, Qing-Na
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2020, 76 (02) : 535 - 569
  • [4] CONSTRAINED BEST EUCLIDEAN DISTANCE EMBEDDING ON A SPHERE: A MATRIX OPTIMIZATION APPROACH
    Bai, Shuanghua
    Qi, Huo-Duo
    Xiu, Naihua
    SIAM JOURNAL ON OPTIMIZATION, 2015, 25 (01) : 439 - 467
  • [5] Euclidean distance matrix completion problems
    Fang, Haw-ren
    O'Leary, Dianne P.
    OPTIMIZATION METHODS & SOFTWARE, 2012, 27 (4-5) : 695 - 717
  • [6] THE EUCLIDEAN DISTANCE MATRIX COMPLETION PROBLEM
    BAKONYI, M
    JOHNSON, CR
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1995, 16 (02) : 646 - 654
  • [7] The cell matrix closest to a given Euclidean distance matrix
    Kurata, Hiroshi
    Tarazaga, Pablo
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2015, 485 : 194 - 207
  • [8] A SEMISMOOTH NEWTON METHOD FOR THE NEAREST EUCLIDEAN DISTANCE MATRIX PROBLEM
    Qi, Hou-Duo
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2013, 34 (01) : 67 - 93
  • [9] Kinetic Euclidean Distance Matrices
    Tabaghi, Puoya
    Dokmanic, Ivan
    Vetterli, Martin
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2020, 68 : 452 - 465
  • [10] Computing the nearest Euclidean distance matrix with low embedding dimensions
    Qi, Hou-Duo
    Yuan, Xiaoming
    MATHEMATICAL PROGRAMMING, 2014, 147 (1-2) : 351 - 389