Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms (Q4638918): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DGM / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/10556788.2017.1371717 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2755334291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete gradient method: Derivative-free method for nonsmooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth nonconvex optimization approach to clusterwise linear regression problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Nonsmooth Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for clusterwise linear regression based on smoothing techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth optimization algorithm for solving clusterwise linear regression problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A maximum likelihood methodology for clusterwise linear regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust clusterwise linear regression through trimming / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC programming: overview. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clusterwise PLS regression on a stochastic process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clusterwise linear regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and global optimization / rank
 
Normal rank

Latest revision as of 13:45, 15 July 2024

scientific article; zbMATH DE number 6865654
Language Label Description Also known as
English
Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
scientific article; zbMATH DE number 6865654

    Statements

    Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms (English)
    0 references
    0 references
    0 references
    2 May 2018
    0 references
    nonsmooth optimization
    0 references
    DC programming
    0 references
    regression analysis
    0 references
    cluster analysis
    0 references
    0 references
    0 references
    0 references

    Identifiers