The triangle method for finding the corner of the L-curve

DOI10.1016/S0168-9274(01)00179-9zbMATH Open1014.65022OpenAlexW2071613752MaRDI QIDQ1861990FDOQ1861990

Authors: J. Longina Castellanos, Valia Guerra, Susana Gómez 

Publication date: 10 March 2003

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-9274(01)00179-9

Recommendations

• Numerical aspects in locating the corner of the L-curve
• The midpoint locus of a triangle in a corner
• An Algebraic Method to Find the Symmedian Point of a Triangle
• scientific article
• On approximating the distance trisector curve

zbMATH Keywords

regularizationnumerical resultsconjugate gradient methodill-conditioned matricestest problemssystems of linear equationsL-curvetriangle methodCG-method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Cites Work

• Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• The regularizing properties of the adjoint gradient method in ill-posed problems
• Title not available (Why is that?)
• Least Squares Methods for Ill-Posed Problems with a Prescribed Bound
• The rate of convergence of conjugate gradients
• Estimation of the \(L\)-curve via Lanczos bidiagonalization
• \(L\)-curve curvature bounds via Lanczos bidiagonalization
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
• Stability of Conjugate Gradient and Lanczos Methods for Linear Least Squares Problems
• Test Matrices for Regularization Methods
• Numerical aspects in locating the corner of the L-curve

Cited In (22)

• Convex constrained optimization for large-scale generalized Sylvester equations
• Compact video content representation for video coding using low multi-linear tensor rank approximation with dynamic core tensor order
• Reconstruction of capacitance tomography images of simulated two-phase flow regimes.
• Noise-reducing cascadic multilevel methods for linear discrete ill-posed problems
• An adaptive pruning algorithm for the discrete L-curve criterion
• Regularization parameter determination for discrete ill-posed problems
• Turbulent mixing and trajectories of jets in a supersonic cross-flow with different injectants
• Numerical aspects in locating the corner of the L-curve
• A new \(L\)-curve for ill-posed problems
• Large scale least squares scattered data fitting
• Old and new parameter choice rules for discrete ill-posed problems
• Meshless thin plate spline methods for the modified Helmholtz equation
• Automatic stopping rule for iterative methods in discrete ill-posed problems
• A generalized LSQR algorithm
• Iterative methods for ill-posed problems and semiconvergent sequences
• The L-curve criterion as a model selection tool in PLS regression
• Mathematical and numerical challenges in diffuse optical tomography inverse problems
• Indirect Trefftz method for solving Cauchy problem of linear piezoelectricity
• Numerical resolution by the quasi-reversibility method of a data completion problem for Maxwell's equations
• A fast algorithm for solving linear inverse problems with uniform noise removal
• Parameter determination for Tikhonov regularization problems in general form
• Extension of GKB-FP algorithm to large-scale general-form Tikhonov regularization.

Uses Software

• Regularization tools

This page was built for publication: The triangle method for finding the corner of the L-curve

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1861990)