Spherical separation with infinitely far center
From MaRDI portal
Publication:2156908
DOI10.1007/s00500-020-05352-2zbMath1491.68253OpenAlexW3092244490MaRDI QIDQ2156908
Antonio Fuduli, Annabella Astorino
Publication date: 21 July 2022
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-020-05352-2
Related Items (4)
Non-standard analysis revisited: an easy axiomatic presentation oriented towards numerical applications ⋮ To the special issue dedicated to the 3rd international conference ``Numerical computations: theory and algorithms -- NUMTA 2019 June 15--21, 2019, Isola Capo Rizzuto, Italy ⋮ Lower and upper estimates of the quantity of algebraic numbers ⋮ A new cutting plane method for lexicographic multi-objective integer linear programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Metamathematical investigations on the theory of grossone
- Multi-instance classification through spherical separation and VNS
- Numerical point of view on calculus for functions assuming finite, infinite, and infinitesimal values over finite, infinite, and infinitesimal domains
- The use of grossone in mathematical programming and operations research
- Computing sums of conditionally convergent and divergent series using the concept of grossone
- DC models for spherical separation
- Higher order numerical differentiation on the infinity computer
- A fixed-center spherical separation algorithm with kernel transformations for classification problems
- Taking the Pirahã seriously
- Using grossone to count the number of elements of infinite sets and the connection with bijections
- Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming
- Margin maximization in spherical separation
- Conjugate-symplecticity properties of Euler-Maclaurin methods and their implementation on the infinity computer
- Classification in the multiple instance learning framework via spherical separation
- Iterative grossone-based computation of negative curvature directions in large-scale optimization
- Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology
- On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales
- A subset-sum type formulation of a two-agent single-machine scheduling problem
- Independence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the opposite
- Edge detection by spherical separation
- Binary classification via spherical separator by DC programming and DCA
- Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems
- Nonlinear programming and grossone: quadratic programing and the role of constraint qualifications
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
- The Sierpinski curve viewed by numerical computations with infinities and infinitesimals
- Methodology of Numerical Computations with Infinities and Infinitesimals
- Non-smoothness in classification problems
- Multiple Instance Learning
- A Simulink-Based Infinity Computer Simulator and Some Applications
- Partitional Clustering Algorithms
- Robust spherical separation
- Linear and Nonlinear Separation of Patterns by Linear Programming
This page was built for publication: Spherical separation with infinitely far center