Binary classification via spherical separator by DC programming and DCA
From MaRDI portal
Publication:2393067
DOI10.1007/s10898-012-9859-6zbMath1275.90093OpenAlexW1966881610MaRDI QIDQ2393067
Huynh Van Ngai, Hoai An Le Thi, Hoai Minh Le, Tao Pham Dinh
Publication date: 7 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9859-6
Related Items
Robust spherical separation ⋮ DC approximation approaches for sparse optimization ⋮ Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model ⋮ Spherical separation with infinitely far center ⋮ DC Programming and DCA for General DC Programs ⋮ Partitional clustering via successive transportation problems ⋮ Sequential difference-of-convex programming ⋮ Efficient Nonnegative Matrix Factorization by DC Programming and DCA ⋮ A DC Programming Approach for Finding Communities in Networks ⋮ DC programming and DCA: thirty years of developments ⋮ Semisupervised spherical separation ⋮ Self-organizing maps by difference of convex functions optimization ⋮ A splitting bundle approach for non-smooth non-convex minimization ⋮ Support vector machine polyhedral separability in semisupervised learning
Cites Work
- Unnamed Item
- Unnamed Item
- Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms
- DC models for spherical separation
- A fixed-center spherical separation algorithm with kernel transformations for classification problems
- Exact \(L_{2}\)-norm plane separation
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Solution of general linear complementarity problems via nondifferentiable concave minimization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- A new efficient algorithm based on DC programming and DCA for clustering
- Pattern separation by convex programming
- A DC programming approach for feature selection in support vector machines learning
- Optimization based DC programming and DCA for hierarchical clustering
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- The Concave-Convex Procedure
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- An Algorithm for Separating Patterns by Ellipsoids
- Ellipsoidal separation for classification problems
