Huber approximation for the non-linear ℓ1 problem
dc.citation.epage | 1107 | en_US |
dc.citation.issueNumber | 3 | en_US |
dc.citation.spage | 1096 | en_US |
dc.citation.volumeNumber | 169 | en_US |
dc.contributor.author | Pınar, Mustafa Ç. | en_US |
dc.contributor.author | Hartmann, W. M. | en_US |
dc.date.accessioned | 2016-02-08T11:48:44Z | en_US |
dc.date.available | 2016-02-08T11:48:44Z | en_US |
dc.date.issued | 2006 | en_US |
dc.department | Department of Industrial Engineering | en_US |
dc.description.abstract | The smooth Huber approximation to the non-linear ℓ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 (1989) to give a new algorithm with rate of convergence results for the smooth Huber approximation. Results of computational tests are reported. | en_US |
dc.identifier.doi | 10.1016/j.ejor.2004.10.029 | en_US |
dc.identifier.issn | 0377-2217 | en_US |
dc.identifier.uri | http://hdl.handle.net/11693/27253 | en_US |
dc.language.iso | English | en_US |
dc.publisher | Elsevier | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1016/j.ejor.2004.10.029 | en_US |
dc.source.title | European Journal of Operational Research | en_US |
dc.subject | Nonlinear programming | en_US |
dc.subject | Non-differentiable optimization | en_US |
dc.subject | Smoothing algorithms | en_US |
dc.subject | Huber M-estimator | en_US |
dc.title | Huber approximation for the non-linear ℓ1 problem | en_US |
dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Huber_approximation_for_the_non-linear_ℓ1_problem.pdf
- Size:
- 204.48 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version