New diagonal bundle method for clustering problems in large data sets (Q1694910): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LDGB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: UCI-ml / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q109595611 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2017.06.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2623902172 / 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: New and efficient DCA based algorithms for minimum sum-of-squares clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Nonsmooth Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An incremental clustering algorithm based on hyperbolic smoothing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder) / 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: An algorithm for minimizing clustering functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of quasi-Newton matrices and their use in limited memory methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for minimum sum-of-squares clustering on networks / 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: Evaluation of a Branch and Bound Algorithm for Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient set splitting in nonconvex nonsmooth numerical optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New limited memory bundle method for large-scale nonsmooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally convergent limited memory bundle method for large-scale nonsmooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood decomposition search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagonal bundle method for nonsmooth sparse optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3316093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally convergent variable metric method for convex nonsmooth unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing based automatic fuzzy clustering combined with ANN classification for analyzing microarray data / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior Point Algorithm for Minimum Sum-of-Squares Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for solving the minimum sum-of-squares clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A clustering search metaheuristic for the point-feature cartographic label placement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A model for clustering data from heterogeneous dissimilarities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hyperbolic smoothing clustering method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions / rank
 
Normal rank

Latest revision as of 02:44, 15 July 2024

scientific article
Language Label Description Also known as
English
New diagonal bundle method for clustering problems in large data sets
scientific article

    Statements

    New diagonal bundle method for clustering problems in large data sets (English)
    0 references
    0 references
    0 references
    0 references
    6 February 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    data mining
    0 references
    nonsmooth optimization
    0 references
    nonconvex optimization
    0 references
    DC function
    0 references
    bundle methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references