1970
DOI: 10.1137/0501006
|View full text |Cite
|
Sign up to set email alerts
|

Least Squares Methods for Ill-Posed Problems with a Prescribed Bound

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
242
0

Year Published

1996
1996
2017
2017

Publication Types

Select...
6
2
2

Relationship

0
10

Authors

Journals

citations
Cited by 467 publications
(242 citation statements)
references
References 8 publications
(9 reference statements)
0
242
0
Order By: Relevance
“…The procedure represented in graphical form is referred to as the L-curve criterion (Hansen, 1994(Hansen, , 1998. The use of such a criterion in connection with ill-posed Least Squares problems goes back to Miller (1970), and Lawson and Hanson (1974). The L-curve criterion is clearly illustrated and extensively applied to the analysis of discrete ill-posed problems by Hansen (1992).…”
Section: The Unfolding Methodsmentioning
confidence: 99%
“…The procedure represented in graphical form is referred to as the L-curve criterion (Hansen, 1994(Hansen, , 1998. The use of such a criterion in connection with ill-posed Least Squares problems goes back to Miller (1970), and Lawson and Hanson (1974). The L-curve criterion is clearly illustrated and extensively applied to the analysis of discrete ill-posed problems by Hansen (1992).…”
Section: The Unfolding Methodsmentioning
confidence: 99%
“…Therefore, the retained α * 's are chosen by dichotomy to verify V(α * ) = 0.1. It can be noted that the proposed procedure for choosing α differs from the so-called Miller criterion (Miller, 1970). The Miller criterion sets α as α * = 2 /E 2 , where stands for the upper bounds of u − Wc 2 and E for the upper bound of c 2 .…”
Section: Determination Of the Regularization Parametermentioning
confidence: 99%
“…Tikhonov regularization, which was first proposed and studied extensively in the1960's and 1970's [63,78,94,95,96], is perhaps the most well known approach to regularizing ill-posed problems. L is typically chosen to be the identity matrix, or a discrete approximation to a derivative operator, such as the Laplacian.…”
Section: Regularizationmentioning
confidence: 99%