A feasible set approach to the crystallographic phase problem

被引:45
|
作者
Marks, LD [1 ]
Sinkler, W [1 ]
Landree, E [1 ]
机构
[1] Northwestern Univ, Dept Mat Sci & Engn, Evanston, IL 60208 USA
来源
关键词
D O I
10.1107/S0108767398014408
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
The connection between the crystallographic phase problem and the feasible set approach is explored. It is argued that solving the crystallographic phase problem is formally equivalent to a feasible set problem using a statistical operator interpretable via a log-likelihood functional, projection onto the non-convex set of experimental structure factors coupled with a phase-extension constraint and mapping onto atomic positions. In no way does this disagree with or dispute any of the existing statistical relationships available in the literature; instead it expands understanding of how the algorithms work. Making this connection opens the door to the application of a number of well developed mathematical tools in functional analysis. Furthermore, a number of known results in image recovery can be exploited both to optimize existing algorithms and to develop new and improved algorithms.
引用
收藏
页码:601 / 612
页数:12
相关论文
共 50 条
  • [41] Rough set approach to sunspot classification problem
    Nguyen, SH
    Nguyen, TT
    Nguyen, HS
    ROUGH SETS, FUZZY SETS, DATA MINING, AND GRANULAR COMPUTING, PT 2, PROCEEDINGS, 2005, 3642 : 263 - 272
  • [42] The query clustering problem: A set partitioning approach
    Gopal, RD
    Ramesh, R
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1995, 7 (06) : 885 - 899
  • [43] EULER APPROXIMATION OF THE FEASIBLE SET
    DONTCHEV, AL
    HAGER, WW
    NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, 1994, 15 (3-4) : 245 - 261
  • [44] A hybrid evolutionary approach for set packing problem
    Chaurasia S.N.
    Sundar S.
    Singh A.
    OPSEARCH, 2015, 52 (2) : 271 - 284
  • [45] A SUBGRADIENT-BASED APPROACH FOR FINDING THE MAXIMUM FEASIBLE SUBSYSTEM WITH RESPECT TO A SET
    Ye, Minglu
    Pong, Ting Kei
    SIAM JOURNAL ON OPTIMIZATION, 2020, 30 (02) : 1274 - 1299
  • [46] The importance of defining the feasible set
    Cowen, Tyler
    ECONOMICS AND PHILOSOPHY, 2007, 23 (01) : 1 - 14
  • [47] A Possibilistic Approach to Set Achievable and Feasible Goals while Designing Complex Systems
    Sow, Diadie
    Imoussaten, Abdelhak
    Couturier, Pierre
    Montmain, Jacky
    IFAC PAPERSONLINE, 2017, 50 (01): : 14218 - 14223
  • [48] Optimization based approach for determining whether a set of elementary contacts is geometrically feasible
    Goeree, Barry B.
    Fasse, Ernest D.
    Marefat, Michael M.
    American Society of Mechanical Engineers, Dynamic Systems and Control Division (Publication) DSC, 1999, 67 : 883 - 889
  • [49] Privacy-Aware Market Basket Data Set Generation: A Feasible Approach for Inverse Frequent Set Mining
    Wu, Xintao
    Wu, Ying
    Wang, Yongge
    Li, Yingjiu
    PROCEEDINGS OF THE FIFTH SIAM INTERNATIONAL CONFERENCE ON DATA MINING, 2005, : 103 - 114
  • [50] The Feasible Matching Problem
    Peng, Yuejian
    Sissokho, Papa A.
    GRAPHS AND COMBINATORICS, 2013, 29 (03) : 695 - 704