期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Study of frequency domain full waveform inversion based on Huber norm and L-BFGS algorithm
1
作者 WEI Yajie HAN Liguo +2 位作者 DUAN Chaoran WANG Hongye GUO Kun 《Global Geology》 2014年第4期238-242,共5页
Full waveform inversion( FWI) is a high resolution inversion method,which can reveal detailed information of the structure and lithology under complex geological background. It is limited by many kinds of noises when ... Full waveform inversion( FWI) is a high resolution inversion method,which can reveal detailed information of the structure and lithology under complex geological background. It is limited by many kinds of noises when the method applied to the real seismic data. Based on Huber function criterion,the objective function combinates the anti-noise of L1 norm and the stability of L2 norm in theory,the authors derive the gradient formula of the Huber function by using L-BFGS algorithm for FWI. The new method is proved by synthetic seismic data with the Gaussian noise and the impulse noise. Numerical test results show that L-BFGS algorithm is applied to the frequency domain FWI with the convergence speed and high calculation accuracy,and can effectively reduce computer memory usage; and the Huber function is more robust and stable than L2 norm even with the noises. 展开更多
关键词 full waveform inversion Huber function L-BFGS algorithm ANTI-NOISE
下载PDF
你问我答
2
《围棋天地》 2003年第24期55-56,共2页
关键词 围棋 业余比赛 韩国 业余棋手 聂卫平 马晓春 七番棋比赛 目数计算
原文传递
A proximal alternating linearization method for minimizing the sum of two convex functions
3
作者 ZHANG WenXing CAI XingJu JIA ZeHui 《Science China Mathematics》 SCIE CSCD 2015年第10期2225-2244,共20页
In this paper, we develop a novel alternating linearization method for solving convex minimization whose objective function is the sum of two separable functions. The motivation of the paper is to extend the recent wo... In this paper, we develop a novel alternating linearization method for solving convex minimization whose objective function is the sum of two separable functions. The motivation of the paper is to extend the recent work Goldfarb et al.(2013) to cope with more generic convex minimization. For the proposed method,both the separable objective functions and the auxiliary penalty terms are linearized. Provided that the separable objective functions belong to C1,1(Rn), we prove the O(1/?) arithmetical complexity of the new method. Some preliminary numerical simulations involving image processing and compressive sensing are conducted. 展开更多
关键词 alternating linearization method arithmetical complexity PROXIMAL SEPARABLE image processing
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部