A method of truncated codifferential with application to some problems of cluster analysis
From MaRDI portal
Publication:1598886
DOI10.1023/A:1014075113874zbMath1034.49009OpenAlexW2143013250MaRDI QIDQ1598886
V. F. Dem'yanov, Alexander Rubinov, Adil M. Bagirov
Publication date: 28 May 2002
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014075113874
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52)
Related Items (21)
Comparing different nonsmooth minimization methods and software ⋮ A Method for Minimization of Quasidifferentiable Functions ⋮ Mathematical diagnostics via nonsmooth analysis ⋮ Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems ⋮ Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization ⋮ Unnamed Item ⋮ Diagonal bundle method for nonsmooth sparse optimization ⋮ A feasible point method with bundle modification for nonsmooth convex constrained optimization ⋮ Extension of primal-dual interior point methods to diff-convex problems on symmetric cones ⋮ A convergence analysis of the method of codifferential descent ⋮ Codifferential method for minimizing nonsmooth DC functions ⋮ A heuristic algorithm for solving the minimum sum-of-squares clustering problems ⋮ Abstract convex approximations of nonsmooth functions ⋮ New global optimality conditions for nonsmooth DC optimization problems ⋮ Diagonal discrete gradient bundle method for derivative free nonsmooth optimization ⋮ Subgradient and Bundle Methods for Nonsmooth Optimization ⋮ The method of codifferential descent for convex and global piecewise affine optimization ⋮ Aggregate codifferential method for nonsmooth DC optimization ⋮ Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization ⋮ Direct Methods in the Parametric Moving Boundary Variational Problem ⋮ K-means clustering via a nonconvex optimization approach
This page was built for publication: A method of truncated codifferential with application to some problems of cluster analysis
