On a scalable nonparametric denoising of time series signals
From MaRDI portal
Publication:1746928
DOI10.2140/camcos.2018.13.107zbMath1385.37084OpenAlexW2784436087MaRDI QIDQ1746928
Patrick Gagliardini, Lukáš Pospíšil, Illia Horenko, William B. Sawyer
Publication date: 26 April 2018
Published in: Communications in Applied Mathematics and Computational Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/544d9379d60ba350c8f16986e043375a573c9c8c
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Quadratic programming (90C20) Parallel numerical computation (65Y05) Time series analysis of dynamical systems (37M10)
Related Items
Statistical Learning of Nonlinear Stochastic Differential Equations from Nonstationary Time Series using Variational Clustering ⋮ On a computationally scalable sparse formulation of the multidimensional and nonstationary maximum entropy principle ⋮ Towards a Computationally Tractable Maximum Entropy Principle for Nonstationary Financial Time Series
Uses Software
Cites Work
- Unnamed Item
- Optimal iterative QP and QPQC algorithms
- Optimal quadratic programming algorithms. With applications to variational inequalities
- An algorithm for finding the distribution of maximal entropy
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Analysis of persistent nonstationary time series and applications
- Minimizing quadratic functions with semidefinite Hessian subject to bound constraints
- Climate time series analysis. Classical statistical and bootstrap methods
- R-linear convergence of the Barzilai and Borwein gradient method
- Solving Contact Mechanics Problems with PERMON
- On Analysis of Nonstationary Categorical Data Time Series: Dynamical Dimension Reduction, Model Selection, and Applications To Computational Sociology
- On inference of causality for discrete state models in a multiscale context
- Finite Element Approach to Clustering of Multidimensional Time Series
- Two-Point Step Size Gradient Methods
- Numerical Optimization
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique for Newton’s Method
- Algorithm 813
- Methods of conjugate gradients for solving linear systems
