![]() | Draft article not currently submitted for review.
This is a draft Articles for creation (AfC) submission. It is not currently pending review. While there are no deadlines, abandoned drafts may be deleted after six months. To edit the draft click on the "Edit" tab at the top of the window. To be accepted, a draft should:
It is strongly discouraged to write about yourself, your business or employer. If you do so, you must declare it. Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
Last edited by MakaMido (talk | contribs) 3 months ago. (Update) |
Part of a series on |
Regression analysis |
---|
Models |
Estimation |
Background |
L-curve is a visualization method used in the field of regularization in numerical analysis and mathematical optimization. It represents a logarithmic plot where the norm of a regularized solution is plotted against the norm of the corresponding residual norm. It is useful for picking an appropriate regularization parameter for the given data. [1]
This method can be applied on methods of regularization of least-square problems, such as Tikhonov regularization and the Truncated SVD [1], and iterative methods of solving ill-posed inverse problems, such as the Landweber algorithm, Modified Richardson iteration and Conjugate gradient method.
References
edit- ^ a b Hansen, P. C. (2001). "The L-curve and its use in the numerical treatment of inverse problems". In Johnston, P. R. (ed.). Computational Inverse Problems in Electrocardiography (PDF). WIT Press. pp. 119–142. ISBN 978-1-85312-614-7.[page needed]