.png){kind=icon}
.png){kind=icon}
Return
Huber approximation for the non-linear l1 problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2004.10.029.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The smooth Huber approximation to the non-linear l(1) problem was proposed by Tishler and Zang (1982), and further developed in Yang (1995). In the present paper, we use the ideas of Gould (19,89) to give a new algorithm with rate of convergence results for the smooth Huber approximation. Results of computational tests are reported. (c) 2005 Elsevier B.V. All rights reserved.
Keywords:
nonlinear programming
non-differentiable optimization
smoothing algorithms
Huber M-estimator
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available