  


Globally Convergent LevenbergMarquardt Method For Phase Retrieval
Chao Ma(machao_pkupku.edu.cn) Abstract: In this paper, we consider a nonlinear least squares model for the phase retrieval problem. Since the Hessian matrix may not be positive definite and the GaussNewton (GN) matrix is singular at any optimal solution, we propose a modified LevenbergMarquardt (LM) method, where the Hessian is substituted by a summation of the GN matrix and a regularization term. Similar to the wellknown Wirtinger flow (WF) algorithm under certain assumptions, we start from an initial point provably close to the set of the global optimal solutions. Global linear convergence and local quadratic convergence to the global solution set are proved by estimating the smallest nonzero eigenvalues of the GN matrix, establishing local error bound properties and constructing a modified regularization condition. The computational cost becomes tractable if a preconditioned conjugate gradient (PCG) method is applied to solve the LM equation inexactly. Specifically, the preconditioner is constructed from the expectation of the LM coefficient matrix by assuming the independence between the measurements and iteration point. Preliminary numerical experiments show that our algorithm is robust and it is often faster than the WF method on both random examples and natural image recovery. Keywords: Nonconvex optimization, phase retrieval, LevenbergMarquardt method, convergence to global optimum Category 1: Nonlinear Optimization Citation: Download: [PDF] Entry Submitted: 06/30/2016 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  