3D magnetic sparse inversion using an interior-point method

Geophysics ◽  
2018 ◽  
Vol 83 (3) ◽  
pp. J15-J32 ◽  
Author(s):  
Zelin Li ◽  
Changli Yao ◽  
Yuanman Zheng ◽  
Junheng Wang ◽  
Yuwen Zhang

Rock susceptibility measurements are sometimes taken on outcrop and borehole rocks, and they provide valuable information for constraining magnetic data inversion. We have developed two approaches for 3D magnetic sparse inversion that effectively take advantage of the rock susceptibility information. Both approaches minimize a total objective function subject to bound constraints using an interior-point method. The first approach directly minimizes an [Formula: see text]-norm of the susceptibility model by keeping the bounds positive, in which case the objective function is differentiable in the feasible region. The second approach minimizes a more generalized [Formula: see text]-like-norm ([Formula: see text]) of the susceptibility model by approximating the [Formula: see text]-like-norm inversion as an iteratively reweighted least-squares problem. Moreover, this approach allows the model values to be either positive or negative. We also revealed the equivalence of our approaches and the binary inversion. The recovered models of both approaches are characterized by sharp boundaries. However, the credibility of recovered boundaries depends on the accuracy and validity of the user-specified upper and lower bounds. Our approaches are tested on the synthetic data and field data acquired over a copper-nickel deposit.


2012 ◽  
Vol 2012 ◽  
pp. 1-21 ◽  
Author(s):  
John Machacek ◽  
Shafiu Jibrin

We investigate solving semidefinite programs (SDPs) with an interior point method called SDP-CUT, which utilizes weighted analytic centers and cutting plane constraints. SDP-CUT iteratively refines the feasible region to achieve the optimal solution. The algorithm uses Newton’s method to compute the weighted analytic center. We investigate different stepsize determining techniques. We found that using Newton's method with exact line search is generally the best implementation of the algorithm. We have also compared our algorithm to the SDPT3 method and found that SDP-CUT initially gets into the neighborhood of the optimal solution in less iterations on all our test problems. SDP-CUT also took less iterations to reach optimality on many of the problems. However, SDPT3 required less iterations on most of the test problems and less time on all the problems. Some theoretical properties of the convergence of SDP-CUT are also discussed.



2020 ◽  
Vol 64 (4) ◽  
pp. 419-435
Author(s):  
Wenwu Zhu ◽  
Junhuan Peng ◽  
Sanming Luo ◽  
Xiangang Meng ◽  
Jinzhao Liu ◽  
...  


2020 ◽  
Vol 177 (2) ◽  
pp. 141-156
Author(s):  
Behrouz Kheirfam

In this paper, we propose a Mizuno-Todd-Ye type predictor-corrector infeasible interior-point method for linear optimization based on a wide neighborhood of the central path. According to Ai-Zhang’s original idea, we use two directions of distinct and orthogonal corresponding to the negative and positive parts of the right side vector of the centering equation of the central path. In the predictor stage, the step size along the corresponded infeasible directions to the negative part is chosen. In the corrector stage by modifying the positive directions system a full-Newton step is removed. We show that, in addition to the predictor step, our method reduces the duality gap in the corrector step and this can be a prominent feature of our method. We prove that the iteration complexity of the new algorithm is 𝒪(n log ɛ−1), which coincides with the best known complexity result for infeasible interior-point methods, where ɛ > 0 is the required precision. Due to the positive direction new system, we improve the theoretical complexity bound for this kind of infeasible interior-point method [1] by a factor of n . Numerical results are also provided to demonstrate the performance of the proposed algorithm.



2014 ◽  
Vol 276 ◽  
pp. 589-611 ◽  
Author(s):  
İ. Temizer ◽  
M.M. Abdalla ◽  
Z. Gürdal






2004 ◽  
Vol 151 (5) ◽  
pp. 575 ◽  
Author(s):  
M.J. Rider ◽  
C.A. Castro ◽  
M.F. Bedrinana ◽  
A.V. Garcia


Sign in / Sign up

Export Citation Format

Share Document