The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions (Q5221263): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Convergence analysis of a proximal point algorithm for minimizing differences of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating the DC algorithm for smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general double-proximal gradient algorithm for d.c. programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4516036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clarke Subgradients of Stratifiable Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Qualitative properties of the minimum sum-of-squares clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized proximal point algorithm for certain non-convex minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: On gradients of functions definable in o-minimal structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence analysis of difference-of-convex algorithm with subanalytic data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552726 / 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: DC programming and DCA: thirty years of developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transactions on Computational Collective Intelligence XIII / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical solution for optimization over the efficient set by d.c. optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5651510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimization method for the sum of a convex function and a continuously differentiable function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3410053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inertial algorithm for DC programming / 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 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
Property / cites work
 
Property / cites work: Q3208459 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3013364710 / rank
 
Normal rank

Latest revision as of 09:30, 30 July 2024

scientific article; zbMATH DE number 7181880
Language Label Description Also known as
English
The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
scientific article; zbMATH DE number 7181880

    Statements

    The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions (English)
    0 references
    25 March 2020
    0 references
    difference of convex functions
    0 references
    boosted difference of convex functions algorithm
    0 references
    Kurdyka-Łojasiewicz property
    0 references
    clustering problem
    0 references
    multidimensional scaling problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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