Show simple item record

dc.contributor.authorPınar, Mustafa Ç.en_US
dc.contributor.authorHartmann, W. M.en_US
dc.date.accessioned2016-02-08T11:48:44Zen_US
dc.date.available2016-02-08T11:48:44Zen_US
dc.date.issued2006en_US
dc.identifier.issn0377-2217en_US
dc.identifier.urihttp://hdl.handle.net/11693/27253en_US
dc.description.abstractThe 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.language.isoEnglishen_US
dc.source.titleEuropean Journal of Operational Researchen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.ejor.2004.10.029en_US
dc.subjectNonlinear programmingen_US
dc.subjectNon-differentiable optimizationen_US
dc.subjectSmoothing algorithmsen_US
dc.subjectHuber M-estimatoren_US
dc.titleHuber approximation for the non-linear ℓ1 problemen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage1096en_US
dc.citation.epage1107en_US
dc.citation.volumeNumber169en_US
dc.citation.issueNumber3en_US
dc.identifier.doi10.1016/j.ejor.2004.10.029en_US
dc.publisherElsevieren_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record