Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms

Bagirov, A. M. and Ugon, J. 2018, Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms, Optimization methods and software, vol. 33, no. 1, pp. 194-219, doi: 10.1080/10556788.2017.1371717.

Attached Files
Name Description MIMEType Size Downloads

Title Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
Author(s) Bagirov, A. M.
Ugon, J.ORCID iD for Ugon, J. orcid.org/0000-0001-5290-8051
Journal name Optimization methods and software
Volume number 33
Issue number 1
Start page 194
End page 219
Total pages 26
Publisher Taylor & Francis
Place of publication Abingdon, Eng.
Publication date 2018-01
ISSN 1055-6788
1029-4937
Language eng
DOI 10.1080/10556788.2017.1371717
Field of Research 0102 Applied Mathematics
0103 Numerical And Computational Mathematics
0802 Computation Theory And Mathematics
HERDC Research category C1.1 Refereed article in a scholarly journal
ERA Research output type C Journal article
Grant ID DP140103213
Copyright notice ©2017, Informa UK Limited
Persistent URL http://hdl.handle.net/10536/DRO/DU:30107626

Document type: Journal Article
Collection: School of Information Technology
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 2 times in TR Web of Science
Scopus Citation Count Cited 3 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 81 Abstract Views, 4 File Downloads  -  Detailed Statistics
Created: Mon, 18 Jun 2018, 12:55:21 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.