Results 81 to 90 of about 522,371 (218)
Failure of the alternating algorithm for best approximation of multivariate functions
Journal of Approximation Theory, 1983 Es seien U und V Teilräume eines normierten Raumes X. Der im Titel erwähnte alternierende Algorithmus führt das Approximationsproblem bzgl. \(U+V\) zurück auf die Approximationsprobleme bzgl. U und V. Die Autoren zitieren Beispiele (aus der Literatur), bei denen der Algorithmus das vorgegebene Approximationsproblem löst und solche, bei denen er es ...
von Golitschek, M, Cheney, E.W
openaire +2 more sources
Algoritmos Wavenet con Aplicaciones en la Aproximación de Señales: un Estudio Comparativo
Revista Iberoamericana de Automática e Informática Industrial RIAI, 2012 Resumen: En este trabajo de investigación se aplican métodos adaptables en el diseño de algoritmos computacionales, dichos algoritmos emplean redes neuronales y series de wavelets para construir âneuroaproximadoresâ wavenets.
C.R. DomÃnguez Mayorga +4 more
doaj +1 more source
, 2018 In this paper, we propose a successive convex approximation framework for sparse optimization where the nonsmooth regularization function in the objective function is nonconvex and it can be written as the difference of two convex functions. The proposed
Chatzinotas, Symeon +3 more
core +1 more source
A cost function for similarity-based hierarchical clustering
, 2015 The development of algorithms for hierarchical clustering has been hampered by a shortage of precise objective functions. To help address this situation, we introduce a simple cost function on hierarchies over a set of points, given pairwise similarities
Eldridge J. +4 more
core +1 more source
On the spacecraft attitude stabilization in the orbital frame [PDF]
Theoretical and Applied Mechanics, 2012 The paper deals with spacecraft in the circular near-Earth orbit. The spacecraft interacts with geomagnetic field by the moments of Lorentz and magnetic forces. The octupole approximation of the Earth’s magnetic field is accepted.
Antipov Kirill A., Tikhonov Alexey A.
doaj +1 more source
An algorithm for low-rank approximation of bivariate functions using splines
Journal of Computational and Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
I. Georgieva, C. Hofreither
openaire +2 more sources
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection [PDF]
, 2011 We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can be viewed in the context of both feature selection and sparse approximation.
Das, Abhimanyu, Kempe, David
core
Algorithmic Cluster Expansions for Quantum Problems
PRX QuantumWe establish a general framework for developing approximation algorithms for a class of counting problems. Our framework is based on the cluster expansion of the abstract polymer model formalism of Kotecký and Preiss.
Ryan L. Mann, Romy M. Minko
doaj +1 more source
Binary Social Mimic Optimization Algorithm With X-Shaped Transfer Function for Feature Selection
IEEE Access, 2020 Definitive optimization algorithms are not able to solve high dimensional optimization problems when the search space grows exponentially with the problem size, and an exhaustive search also becomes impractical. To encounter this problem, researchers use
Kushal Kanti Ghosh +4 more
doaj +1 more source
Physico-Mathematical Modelling and Informational Technologies, 2023 Olena Kolomys, Liliya Luts
semanticscholar +1 more source