SEG Technical Program Expanded Abstracts 2015 2015
DOI: 10.1190/segam2015-5925071.1
|View full text |Cite
|
Sign up to set email alerts
|

A short note on rank-2 relaxation for waveform inversion

Abstract: This note is a first attempt to perform waveform inversion by utilizing recent developments in semidefinite relaxations for polynomial equations to mitigate non-convexity. The approach consists in reformulating the inverse problem as a set of constraints on a low-rank moment matrix in a higher-dimensional space. While this idea has mostly been a theoretical curiosity so far, the novelty of this note is the suggestion that a modified adjoint-state method enables algorithmic scalability of the relaxed formulatio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
3
1
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 22 publications
0
3
0
Order By: Relevance
“…However, a lifting approach similar to that used in [2] to expand the search space of the model could be applied. We replace the outer product of the two identical vectors with two identical low-rank matrices to expand the space of search directions (note that we cannot get a rank one solution unless an extra low-rank penalty is added.)…”
Section: A New Algorithm For Blind Deconvolutionmentioning
confidence: 99%
“…However, a lifting approach similar to that used in [2] to expand the search space of the model could be applied. We replace the outer product of the two identical vectors with two identical low-rank matrices to expand the space of search directions (note that we cannot get a rank one solution unless an extra low-rank penalty is added.)…”
Section: A New Algorithm For Blind Deconvolutionmentioning
confidence: 99%
“…Since X ∈ C (nu+ng+1) 2 , we are not able to optimize over X directly for large-scale realistic applications. Nonetheless, as stated by Cosse et al [2015], it is possible for us to obtain a computationally feasible formulation with a reasonable storage requirement by introducing a rank-r factorization RR for the matrix X:…”
Section: Wri With a Rank-r Relaxationmentioning
confidence: 99%
“…Through tuning the penalty parameter, the resulting approach does not enforce the PDE constraints at each iteration and arguably yields a less non-linear problem in the model parameter. The "Lift" strategy follows the early work in Cosse et al [2015] that borrows ideas from recent developments in the semidefinite relaxation for polynomial equations to mitigate non-convexity [Lasserre, 2001, Laurent, 2009. We lift both unknown wavefields and model parameters from 1D vectors to rank-2 matrices, and reformulate the WRI problem as a set of constraints on a rank-2 moment matrix in a higher dimensional space.…”
Section: Introductionmentioning
confidence: 99%