Numerical Algorithms for Non-smooth Optimization Applicable to Seismic Recovery
Ignace Loris ()
Additional contact information
Ignace Loris: Université libre de Bruxelles
A chapter in Handbook of Geomathematics, 2015, pp 1905-1942 from Springer
Abstract:
Abstract Inverse problems in seismic tomography are often cast in the form of an optimization problem involving a cost function composed of a data misfit term and regularizing constraint or penalty. Depending on the noise model that is assumed to underlie the data acquisition, these optimization problems may be non-smooth. Another source of lack of smoothness (differentiability) of the cost function may arise from the regularization method chosen to handle the ill-posed nature of the inverse problem. A numerical algorithm that is well suited to handle minimization problems involving two non-smooth convex functions and two linear operators is studied. The emphasis lies on the use of some simple proximity operators that allow for the iterative solution of non-smooth convex optimization problems. Explicit formulas for several of these proximity operators are given and their application to seismic tomography is demonstrated.
Keywords: Proximal Operator; Data Misfit; Global Seismic Tomography; Uniform Noise Model; Linear Inverse Problems (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-54551-1_65
Ordering information: This item can be ordered from
http://www.springer.com/9783642545511
DOI: 10.1007/978-3-642-54551-1_65
Access Statistics for this chapter
More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().