Fetching the paper…
Reading the bibliography…
The problem of low-rank approximation with convex constraints, which appears in data analysis, system identification, model order reduction, low-order controller design and low-complexity modelling is considered.
C. Berge, Topological Spaces: Including a Treatment of Multi-Valued Functions, Vector Spaces, and Convexity . Courier Corporation, 1963
1963
Earlier work this paper cites.
R. T. Rockafellar, Convex Analysis . Princeton University Press, 1970
1970
Earlier work this paper cites.
S. Y. Kung, “A new identification and model reduction algorithm via singular value decomposition,” 12th Asilomar Conference on Circuits, Systems and Computers , pp. 705–714, 1978
1978
Earlier work this paper cites.
K. Glover, “All optimal Hankel-norm approximations of linear multivariable systems and their L ∞ L_{\infty} -error bounds,” International Journal of Control , vol. 39, no. 6, pp. 1115–1193, 1984
1984
Earlier work this paper cites.
G. W. Stewart and J.-g. Sun, Matrix Perturbation Theory . Academic press, 1990
1990
Earlier work this paper cites.
——, Convex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods , ser. Grundlehren der mathematischen Wissenschaften. Springer Berlin Heidelberg, 1993
1993
Earlier work this paper cites.
J.-B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms I: Fundamentals , ser. Grundlehren der mathematischen Wissenschaften. Springer Berlin Heidelberg, 1996
1996
Earlier work this paper cites.
G. C. Reinsel and R. Velu, Multivariate Reduced-Rank Regression: Theory and Applications , ser. Lecture Notes in Statistics. Springer New York, 1998, vol. 136
1998
Earlier work this paper cites.
M. Fazel, H. Hindi, and S. P. Boyd, “A rank minimization heuristic with application to minimum order system approximation,” in Proceedings of the 2001 American Control Conference. , vol. 6, 2001, pp. 4734–4739
2001
Earlier work this paper cites.
D. Peaucelle, D. Henrion, Y. Labit, and K. Taitz, “User’s guide for SEDUMI INTERFACE 1.04,” 2002, LAAS-CNRS, Toulouse
2002
Earlier work this paper cites.
M. T. Chu, R. E. Funderlic, and R. J. Plemmons, “Structured low rank approximation,” Linear Algebra and its Applications , vol. 366, pp. 157 – 172, 2003
2003
Earlier work this paper cites.
A. Antoulas, Approximation of Large-Scale Dynamical Systems . SIAM, 2005
2005
Earlier work this paper cites.
L. Eldén, Matrix methods in data mining and pattern recognition . SIAM, 2007
2007
Earlier work this paper cites.
E. J. Candès, M. B. Wakin, and S. P. Boyd, “Enhancing sparsity by reweighted ℓ 1 \ell_{1} minimization,” Journal of Fourier Analysis and Applications , vol. 14, no. 5, pp. 877–905, 2008
2008
Earlier work this paper cites.
E. J. Candès and B. Recht, “Exact matrix completion via convex optimization,” Foundations of Computational Mathematics , vol. 9, no. 6, p. 717, 2009
2009
Earlier work this paper cites.
L. Jacob, G. Obozinski, and J.-P. Vert, “Group lasso with overlaps and graph lasso,” in Proceedings of the 26th International Conference on Machine Learning , L. Bottou and M. Littman, Eds. Montreal: Omnipress, June 2009, pp. 433–440
2009
Cited alongside, same era.
B. Recht, M. Fazel, and P. A. Parrilo, “Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,” SIAM Review , vol. 52, no. 3, pp. 471–501, 2010
2010
Cited alongside, same era.
Z. Liu and L. Vandenberghe, “Interior-point method for nuclear norm approximation with application to system identification,” SIAM Journal on Matrix Analysis and Applications , vol. 31, no. 3, pp. 1235–1256, 2010
2010
Cited alongside, same era.
D. Ankelhed, “On design of low order H-infinity controllers,” Ph.D. dissertation, Linköping University, 2011
2011
Cited alongside, same era.
T. Hastie, R. Tibshirani, and M. Wainwright, Statistical Learning with Sparsity: The Lasso and Generalizations . CRC Press, 2015
2015
Later among the works it cites.
M. Zorzi and R. Sepulchre, “Factor analysis of moving average processes,” in 2015 European Control Conference (ECC) , 2015, pp. 3579–3584
2015
Later among the works it cites.
C. Grussler and A. Rantzer, “On optimal low-rank approximation of non-negative matrices,” in 54th IEEE Conference on Decision and Control (CDC) , 2015, pp. 5278–5283
2015
Later among the works it cites.
R. Vidal, Y. Ma, and S. S. Sastry, Generalized Principal Component Analysis , ser. Interdisciplinary Applied Mathematics. Springer-Verlag New York, 2016, vol. 40
2016
Closest in time.
C. Grussler, A. Zare, M. R. Jovanovic, and A. Rantzer, “The use of the r ∗ r\ast heuristic in covariance completion problems,” in 55th IEEE Conference on Decision and Control (CDC) , 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. L. Combettes and J.-C. Pesquet, Proximal Splitting Methods in Signal Processing . Springer New York, 2011, pp. 185–212
2011
Cited alongside, same era.
D. N. Miller and R. A. de Callafon, “Identification of linear time-invariant systems via constrained step-based realization,” IFAC Proceedings Volumes , vol. 45, no. 16, pp. 1155 – 1160, 2012, 16th IFAC Symposium on System Identification
2012
Cited alongside, same era.
H. Hjalmarsson, J. S. Welsh, and C. R. Rojas, “Identification of Box-Jenkins models using structured ARX models and nuclear norm relaxation,” IFAC Proceedings Volumes , vol. 45, no. 16, pp. 322 – 327, 2012, 16th IFAC Symposium on System Identification
2012
Cited alongside, same era.
V. Chandrasekaran, B. Recht, P. A. Parrilo, and A. S. Willsky, “The convex geometry of linear inverse problems,” Foundations of Computational Mathematics , vol. 12, no. 6, pp. 805–849, 2012
2012
Cited alongside, same era.
F. Bach, R. Jenatton, J. Mairal, and G. Obozinski, “Optimization with sparsity-inducing penalties,” Foundations and Trends in Machine Learning , vol. 4, no. 1, pp. 1–106, 2012
2012
Cited alongside, same era.
V. D. Blondel, E. D. Sontag, M. Vidyasagar, and J. C. Willems, Open problems in mathematical systems and control theory . Springer Science & Business Media, 2012
2012
Cited alongside, same era.
R. A. Horn and C. R. Johnson, Matrix Analysis , 2nd ed. Cambridge University Press, 2012
2012
Cited alongside, same era.
A. Argyriou, R. Foygel, and N. Srebro, “Sparse prediction with the k-support norm,” in Advances in Neural Information Processing Systems 25 , F. Pereira, C. J. C. Burges, L. Bottou, and K. Q. Weinberger, Eds. Curran Associates, Inc., 2012, pp. 1457–1465
2012
Cited alongside, same era.
2016
Closest in time.
——, “AR identification of latent-variable graphical models,” IEEE Transactions on Automatic Control , vol. 61, no. 9, pp. 2327–2340, 2016
2016
Closest in time.
V. Larsson and C. Olsson, “Convex low rank approximation,” International Journal of Computer Vision , vol. 120, no. 2, pp. 194–214, 2016
2016
Closest in time.
2016
Closest in time.
2016
Closest in time.
A. Zare, Y. Chen, M. R. Jovanović, and T. T. Georgiou, “Low-complexity modeling of partially available second-order statistics: Theory and an efficient matrix completion algorithm,” IEEE Transactions on Automatic Control , vol. 62, no. 3, pp. 1368–1383, March 2017
2017
Closest in time.
A. Zare, M. R. Jovanović, and T. T. Georgiou, “Colour of turbulence,” Journal of Fluid Mechanics , vol. 812, pp. 636–680, 2017
2017
Closest in time.
C. Grussler, “Rank reduction with convex constraints,” Ph.D. dissertation, Lund University, 2017
2017
Closest in time.
——, “Local convergence of proximal splitting methods for rank constrained problems,” in 2017 IEEE 56th Annual Conference on Decision and Control (CDC) , 2017, pp. 702–708
2017
Closest in time.
C. Grussler, “LRINorm,” https://github.com/LowRankOpt/LRINorm , 2018
2018
Closest in time.