Analysis and Design in the Problem of Vector Deconvolution

  • Anatoly ZhigljavskyEmail author
  • Nina Golyandina
  • Jonathan Gillard
Conference paper
Part of the Contributions to Statistics book series (CONTRIB.STAT.)


We formulate the problem of deconvolution of a given vector as an optimal design problem and suggest numerical algorithms for solving this problem. We then discuss an important application of the proposed methods for problems of time series analysis and signal processing and also to the low-rank approximation of structured matrices.


Singular Value Decomposition Little Square Estimate Singular Spectrum Analysis Global Optimization Technique Hankel Matrice 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



(i) The authors are grateful to all three referees for their interesting and valuable comments. (ii) Research of the first author was supported by the Russian Science Foundation, project No. 15-11-30022 “Global optimization, supercomputing computations, and applications”.


  1. 1.
    Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge/New York (2004)CrossRefzbMATHGoogle Scholar
  2. 2.
    Chu, M.T., Funderlic, R.E., Plemmons, R.J.: Structured low rank approximation. Linear Algebra Appl. 366, 157–172 (2003)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Frank, M., Wolfe, P.: An algorithm for quadratic programming. Nav. Res. Logist. Q. 3, 95–110 (1956)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Gillard, J., Zhigljavsky, A.: Optimization challenges in the structured low rank approximation problem. J. Glob. Optim. 57, 733–751 (2013)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Gillard, J., Zhigljavsky, A.: Application of structured low-rank approximation methods for imputing missing values in time series. Stat. Interface 8, 321–330 (2015)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Gillard, J., Zhigljavsky, A.: Stochastic algorithms for solving structured low-rank matrix approximation problems. Commun. Nonlinear Sci. Numer. Simul. 21, 70–88 (2015)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Golyandina, N., Korobeynikov, A.: Basic singular spectrum analysis and forecasting. R. Comput. Stat. Data Anal. 71, 934–954 (2014)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Golyandina, N., Nekrutkin, V., Zhigljavsky, A.: Analysis of Time Series Structure: SSA and Related Techniques. CRC Press, Boca Raton (2001)CrossRefzbMATHGoogle Scholar
  9. 9.
    Golyandina, N., Shlemov, A.: Variations of singular spectrum analysis for separability improvement: non-orthogonal decompositions of time series. Stat. Interface 8, 277–294 (2015)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Golyandina, N., Zhigljavsky, A.: Singular Spectrum Analysis for Time Series. Springer, New York (2013)CrossRefzbMATHGoogle Scholar
  11. 11.
    Zhigljavsky, A.A.: Theory of Global Random Search. Kluwer Academic Press, Dordrecht (1991)CrossRefGoogle Scholar
  12. 12.
    Zhigljavsky, A.A., Zilinskas, A.G.: Stochastic Global Optimization. Springer, New York (2008)zbMATHGoogle Scholar
  13. 13.
    Zvonarev, N., Golyandina, N.: Iterative algorithms for weighted and unweighted finite-rank time-series approximations. Stat. Interface 9 (4), (2016, to appear). arxiv

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Anatoly Zhigljavsky
    • 1
    • 2
    Email author
  • Nina Golyandina
    • 3
  • Jonathan Gillard
    • 1
  1. 1.Cardiff UniversityCardiffUK
  2. 2.Lobachevskii Nizhnii Novgorod State UniversityNizhny NovgorodRussia
  3. 3.St.Petersburg State UniversitySt. PetersburgRussia

Personalised recommendations