A dual reformulation and solution framework for regularized convex clustering problems (Q2029898): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2020.09.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3084810813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of Euclidean sum-of-squares clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing and First Order Methods: A Unified Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Templates for convex cone problems with applications to sparse signal recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional-bandwidth kernel for support vector machine with functional data: an alternating optimization algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable selection in classification for multivariate functional data / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for total variation minimization and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex biclustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hard problems in hierarchical-tree clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biclustering via Sparse Singular Value Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar k-Means Problem is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing clusterings -- an information based distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing technique and its applications in semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive restart for accelerated gradient schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applied functional data analysis. Methods and case studies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear total variation based noise removal algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph dual regularization non-negative matrix factorization for co-clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation accuracy, gradient methods, and error bound for structured convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Convex Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Feature Selection in Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Adaptive Lasso and Its Oracle Properties / rank
 
Normal rank

Latest revision as of 22:26, 25 July 2024

scientific article
Language Label Description Also known as
English
A dual reformulation and solution framework for regularized convex clustering problems
scientific article

    Statements

    A dual reformulation and solution framework for regularized convex clustering problems (English)
    0 references
    0 references
    0 references
    0 references
    4 June 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    global optimization
    0 references
    convex clustering
    0 references
    mathematical programming
    0 references
    gradient descent
    0 references
    duality
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references