Approximation, dimension reduction, and nonconvex optimization using linear superpositions of Gaussians

DOI10.1109/12.257708zbMATH Open1395.90245OpenAlexW2141513596MaRDI QIDQ5375334FDOQ5375334

Authors: Avijit Saha, Chuanlin Wu, Dun-Sung Tang 

Publication date: 14 September 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.257708

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Estimation and detection in stochastic control theory (93E10)

Cited In (5)

• Multiple Mittag-Leffler stability of fractional-order competitive neural networks with Gaussian activation functions
• Prediction of structural classes for protein sequences and domains--impact of prediction algorithms, sequence representation and homology, and test procedures on accuracy
• Approximation and learning of convex superpositions
• Finite-Dimensional Gaussian Approximation with Linear Inequality Constraints
• Title not available (Why is that?)

This page was built for publication: Approximation, dimension reduction, and nonconvex optimization using linear superpositions of Gaussians

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375334)