稀疏相位检索问题的光滑化方法研究
Research on Smoothing Method for Sparse Phase Retrieval Problems
DOI: 10.12677/AAM.2021.1011409, PDF, HTML, 下载: 238  浏览: 377  国家自然科学基金支持
作者: 刘晓佳, 彭定涛*:贵州大学,数学与统计学院,贵州 贵阳
关键词: 稀疏相位检索问题最小一乘估计方向稳定点光滑化方法Sparse Phase Retrieval Problem Least Absolute Estimate Directional Stationary Point Smoothing Method
摘要: 对稀疏相位检索问题,本文建立了稀疏最小一乘优化模型。首先,将不连续的稀疏正则函数松弛为连续的Capped-L1正则函数。利用方向导数和方向稳定点建立了该松弛问题的一阶最优性条件。进一步,分析了方向稳定点的下界性质,并建立了松弛问题与原始问题全局解的等价性。最后,本文建议采用光滑化方法求解该问题。构造了目标函数的光滑化函数,并建立了光滑问题与松弛问题解的一致性,为使用光滑化方法求解该问题提供了理论保证。
Abstract: For sparse phase retrieval problems, this paper constructed a class of sparse least absolute deviation optimization model. First, we used the continuous Capped-L1 regularization function to relax the discontinuous sparsity function. By virtue of directional derivatives and the directional stationary points, we provided the first- order optimality condition for the relaxed optimization problem. Furthermore, we derived the lower bound property of the directional stationary points, based on which we proved the equivalence between the original problem and the relaxed problem in the sense of global solutions. Finally, we advised using smoothing methods to solve the relaxed problem. We proposed a class of smooth function to approximate the objective function, and established the consistency of the solutions of the smoothing problem and the relaxed problem. Our result provides a theoretical basis for using smoothing methods to solve sparse phase retrieval problems.
文章引用:刘晓佳, 彭定涛. 稀疏相位检索问题的光滑化方法研究[J]. 应用数学进展, 2021, 10(11): 3850-3864. https://doi.org/10.12677/AAM.2021.1011409

参考文献

[1] Harrison, R. (1993) Phase Problem in Crystallography. Journal of the Optical Society of Amer- ica A, 10, 1046-1055.
https://doi.org/10.1364/JOSAA.10.001046
[2] Miao, J., Ishikawa, T. and Shen, Q. (2008) Extending X-Ray Crystallography to Allow the Imaging of Noncrystalline Materials, Cells, and Single Protein Complexes. Annual Review of Physical Chemistry, 59, 387-410.
https://doi.org/10.1146/annurev.physchem.59.032607.093642
[3] Bunk, O., Diaz, A. and Pfeiffer, F. (2014) Diffractive Imaging for Periodic Samples: Retrieving One-Dimensional Concentration Profiles across Microfluidic Channels. Acta Crystallographica Section A: Foundations of Crystallography, 63, 306-314.
https://doi.org/10.1107/S0108767307021903
[4] Dainty, J. and Fienup, J. (1987) Phase Retrieval and Image Reconstruction for Astronomy. In: Stark, H., Ed., Image Recovery: Theory and Application, Academic Press, San Diego, 231-275.
[5] Cai, T., Li, X. and Ma, Z. (2016) Optimal Rates of Convergence for Noisy Sparse Phase Retrieval via Thresholded Wirtinger Flow. The Annals of Statistics, 44, 2221-2251.
https://doi.org/10.1214/16-AOS1443
[6] Sun, J., Qu, Q. and Wright, J. (2018) A Geometric Analysis of Phase Retrieval. Foundations of Computational Mathematics, 18, 1131-1198.
https://doi.org/10.1007/s10208-017-9365-9
[7] Shechtman, Y., Beck, A. and Eldar, Y. (2014) GESPAR: Efficient Phase Retrieval of Sparse Signals. IEEE Transactions on Signal Processing, 62, 928-938.
https://doi.org/10.1109/TSP.2013.2297687
[8] Cand`es, E., Li, X. and Soltanolkotabi, M. (2015) Phase Retrieval via Wirtinger Flow: Theory and Algorithms. IEEE Transactions on Information Theory, 61, 1985-2007.
https://doi.org/10.1109/TIT.2015.2399924
[9] Yang, Z., Yang, L., Fang, E., et al. (2019) Misspecified Nonconvex Statistical Optimization for Sparse Phase Retrieval. Mathematical Programming, 176, 545-571.
https://doi.org/10.1007/s10107-019-01364-5
[10] Davis, D., Drusvyatskiy, D. and Paquette, C. (2020) The Nonsmooth Landscape of Phase Retrieval. IMA Journal of Numerical Analysis, 40, 2652-2695.
https://doi.org/10.1093/imanum/drz031
[11] Eldar, Y. and Mendelson, S. (2013) Phase Retrieval: Stability and Recovery Guarantees. Applied and Computational Harmonic Analysis, 36, 473-494.
https://doi.org/10.1016/j.acha.2013.08.003
[12] Duchi, J. and Ruan, F. (2019) Solving (Most) of a Set of Quadratic Equalities: Composite Optimization for Robust Phase Retrieval. Information and Inference: A Journal of the IMA, 8, 471-529.
https://doi.org/10.1093/imaiai/iay015
[13] Peng, D. and Chen, X. (2020) Computation of Second-Order Directional Stationary Points for Group Sparse Optimization. Optimization Methods and Software, 35, 348-376.
https://doi.org/10.1080/10556788.2019.1684492
[14] Le, T., Pham, D., Le, H., et al. (2015) Approximation Approaches for Sparse Optimization. European Journal of Operational Research, 244, 26-46.
https://doi.org/10.1016/j.ejor.2014.11.031
[15] Pang, J., Razaviyayn, M. and Alvarado, A. (2017) Computing B-Stationary Points of Nons- mooth DC Programs. Mathematics of Operations Research, 42, 95-118.
https://doi.org/10.1287/moor.2016.0795
[16] Gong, P., Zhang, C., Lu, Z., et al. (2013) A General Iterative Shrinkage and Thresholding Algorithm for Nonconvex Regularized Optimization Problems. Proceedings of the 30th Inter- national Conference on Machine Learning, 28, 37-45.
[17] Bian, W. and Chen, X. (2020) A Smoothing Proximal Gradient Algorithm for Nonsmooth Convex Regression with Cardinality Penalty. SIAM Journal on Numerical Analysis, 58, 858- 883.
https://doi.org/10.1137/18M1186009
[18] Ahn, M., Pang, J. and Xin, J. (2017) Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity. SIAM Journal on Optimization, 27, 1637-1665.
https://doi.org/10.1137/16M1084754
[19] Cui, Y., Pang, J. and Sen, B. (2018) Composite Difference-Max Programs for Modern Statis- tical Estimation Problems. SIAM Journal on Optimization, 28, 3344-3374.
https://doi.org/10.1137/18M117337X
[20] Soubies, E., Blanc-F´eraud, L. and Aubert, G. (2017) A Unified View of Exact Continuous Penalties for l2 − l0 Minimization. SIAM Journal on Optimization, 27, 2034-2060.
https://doi.org/10.1137/16M1059333
[21] 彭定涛, 唐琦, 张弦. 组稀疏优化问题精确连续Capped-L1松弛[J]. 数学学报, 2021.
[22] 高岩. 非光滑优化[M]. 北京: 科学出版社, 2008.
[23] Clarke, F. (1990) Optimization and Nonsmooth Analysis. Wiley, New York.
https://doi.org/10.1137/1.9781611971309