The Confrontation of Two Clustering Methods in Portfolio Management: Ward’s Method Versus DCA Method (Q3192958): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5180702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Groups in Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC Programming and DCA for General DC Programs / 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: A new efficient algorithm based on DC programming and DCA for clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications / rank
 
Normal rank

Latest revision as of 22:16, 10 July 2024

scientific article
Language Label Description Also known as
English
The Confrontation of Two Clustering Methods in Portfolio Management: Ward’s Method Versus DCA Method
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references