On numerical solving the spherical separability problem
From MaRDI portal
Publication:330492
DOI10.1007/s10898-015-0319-yzbMath1379.90027OpenAlexW2111360013MaRDI QIDQ330492
Alexander S. Strekalovsky, Manlio Gaudioso, Tatiana V. Gruzdeva
Publication date: 26 October 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0319-y
Related Items (3)
Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints ⋮ Minimizing sequences in a constrained DC optimization problem ⋮ K-means clustering via a nonconvex optimization approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On local search in d.c. optimization problems
- DC models for spherical separation
- A fixed-center spherical separation algorithm with kernel transformations for classification problems
- The BFGS method with exact line searches fails for non-convex objective functions
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Introduction to global optimization
- Margin maximization in spherical separation
- On computational search for optimistic solutions in bilevel problems
- Edge detection by spherical separation
- On the divergence of line search methods
- On a continuous approach for the maximum weighted clique problem
- Pattern separation by convex programming
- Introduction to Global Optimization Exploiting Space-Filling Curves
- On Solving Optimization Problems with Hidden Nonconvex Structures
- 10.1162/15324430260185583
- Numerical Optimization
- Local search in problems with nonconvex constraints
- Linear and Nonlinear Separation of Patterns by Linear Programming
- Polyhedral separability through successive LP
This page was built for publication: On numerical solving the spherical separability problem
