Convex constrained optimization for the seismic reflection tomography problem

被引:11
|
作者
Bello, Lenys
Raydan, Marcos
机构
[1] Cent Univ Venezuela, Dpto Computac, Caracas 1041A, Venezuela
[2] Univ Carabobo, Fac Expt Ciencia & Tecnol, Ctr Multidisciplinario Visualizac & Computo Cient, Valencia, Venezuela
关键词
seismic tomography; ray tracing; nonlinear least-squares; spectral projected gradient method;
D O I
10.1016/j.jappgeo.2006.10.004
中图分类号
P [天文学、地球科学];
学科分类号
07 ;
摘要
The nonlinear seismic reflection tomography problem consists on minimizing the function g(p)=parallel to T-f(p)parallel to(2)(2) where p is a vector containing the velocity model parameters and depth position of the reflectors, Tcontains the travel time of the rays, and f(p) is a nonlinear function that depends on the velocity of the subsurfaces. Recently a new approach, based on the spectral gradient method, was applied to find unconstrained local minimizers of g(p). This new idea requires very low storage and computational cost, but it presents an erratic behavior when applied to ill-conditioned problems. In this work, we combine the new low cost iterative technique with the recently proposed spectral projected method for convex constrained optimization to improve the convergence of the process, and to avoid the erratic behavior by imposing regularity into the optimization problem. Preliminary numerical experiments are also presented on synthetic data sets to illustrate the advantages of the new combined scheme. (c) 2006 Elsevier B.V All rights reserved.
引用
收藏
页码:158 / 166
页数:9
相关论文
共 50 条
  • [41] Constrained k-Center Problem on a Convex Polygon
    Basappa, Manjanna
    Jallu, Ramesh K.
    Das, Gautam K.
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2020, 31 (02) : 275 - 291
  • [42] Fast primal-dual algorithm with Tikhonov regularization for a linear equality constrained convex optimization problem
    Zhu, Ting-Ting
    Fang, Ya-Ping
    Hu, Rong
    NUMERICAL ALGORITHMS, 2025,
  • [43] Problem of inclined layers in seismic reflection methods
    Specht, Z
    TRANSACTIONS OF THE AMERICAN INSTITUTE OF MINING AND METALLURGICAL ENGINEERS, 1940, 138 : 294 - 300
  • [44] Fast primal-dual algorithm via dynamical system for a linearly constrained convex optimization problem
    He, Xin
    Hu, Rong
    Fang, Ya-Ping
    AUTOMATICA, 2022, 146
  • [45] On the circumcentered-reflection method for the convex feasibility problem
    Roger Behling
    Yunier Bello-Cruz
    Luiz-Rafael Santos
    Numerical Algorithms, 2021, 86 : 1475 - 1494
  • [46] On the circumcentered-reflection method for the convex feasibility problem
    Behling, Roger
    Bello-Cruz, Yunier
    Santos, Luiz-Rafael
    NUMERICAL ALGORITHMS, 2021, 86 (04) : 1475 - 1494
  • [47] On One Problem of the Nonlinear Convex Optimization
    Vrabel, Robert
    APPLIEDMATH, 2022, 2 (04): : 512 - 517
  • [48] Sensitivity Functionals in Convex Optimization Problem
    Namm, Robert V.
    Woo, Gyungsoo
    FILOMAT, 2016, 30 (14) : 3681 - 3687
  • [49] Convex optimization problem prototyping for image reconstruction in computed tomography with the Chambolle-Pock algorithm
    Sidky, Emil Y.
    Jorgensen, Jakob H.
    Pan, Xiaochuan
    PHYSICS IN MEDICINE AND BIOLOGY, 2012, 57 (10): : 3065 - 3091
  • [50] MASS OPTIMIZATION PROBLEM WITH CONVEX COST
    Buttazzo, Giuseppe
    Gelli, Maria Stella
    Lucic, Danka
    SIAM JOURNAL ON MATHEMATICAL ANALYSIS, 2023, 55 (05) : 5617 - 5642