The use of grossone in elastic net regularization and sparse support vector machines
From MaRDI portal
Publication:2156901
DOI10.1007/S00500-020-05185-ZzbMATH Open1491.65047OpenAlexW3045034854WikidataQ124542140 ScholiaQ124542140MaRDI QIDQ2156901FDOQ2156901
Authors: Renato De Leone, N. Egidi, Lorella Fatone
Publication date: 21 July 2022
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11581/440967
Recommendations
- Elastic-net regularization in learning theory
- Kernelized elastic net regularization: generalization bounds, and sparse recovery
- Spectrally Sparse Nonparametric Regression via Elastic Net Regularized Smoothers
- Elastic-Net Regularization: Iterative Algorithms and Asymptotic Behavior of Solutions
- Elastic-net regularization: error estimates and active set methods
- Generalized conditional gradient method for elastic-net regularization
- Regularization and Variable Selection Via the Elastic Net
- Elastic-net regularization versus ℓ 1 -regularization for linear inverse problems with quasi-sparse solutions
- A generalized elastic net regularization with smoothed \(\ell _{q}\) penalty for sparse vector recovery
Numerical optimization and variational techniques (65K10) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- Support-vector networks
- Sparse Approximate Solutions to Linear Systems
- On accuracy of mathematical languages used to deal with the Riemann zeta function and the Dirichlet eta function
- Metamathematical investigations on the theory of grossone
- Methodology of Numerical Computations with Infinities and Infinitesimals
- Numerical point of view on calculus for functions assuming finite, infinite, and infinitesimal values over finite, infinite, and infinitesimal domains
- An application of grossone to the study of a family of tilings of the hyperbolic plane
- The use of grossone in mathematical programming and operations research
- Interpretation of percolation in terms of infinity computations
- Higher order numerical differentiation on the infinity computer
- Concave programming for minimizing the zero-norm over polyhedral sets
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
- Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems
- A classification of two-dimensional cellular automata using infinite computations
- Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm
- DC formulations and algorithms for sparse optimization problems
- The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area
- Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming
- A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic
- Nonlinear programming and grossone: quadratic programing and the role of constraint qualifications
- On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales
- Independence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the opposite
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
- The Sierpinski curve viewed by numerical computations with infinities and infinitesimals
Cited In (2)
This page was built for publication: The use of grossone in elastic net regularization and sparse support vector machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2156901)