R300 - Institut de Recherche en Technologies de l'Information et Sciences de l'Informatique R450 - Institut NUMEDIART pour les Technologies des Arts Numériques
European Projects :
HE - 101085607 - eLinoR - Beyond Low-Rank Factorizations
Ang AMS Gillis N Accelerating nonnegative matrix factorization algorithms using extrapolation Neural Comput. 2019 31 2 417 439 3910334 10.1162/neco_a_01157
Bauschke H Bui M Wang X Projecting onto the intersection of a cone and a sphere SIAM J. Optim. 2018 28 2158 2188 3835600 10.1137/17M1141849
Deshpande, Y., Montanari, A., Richard, E.: Cone-constrained principal component analysis. In: Adv. Neural Inf. Process Syst., pp. 2717–2725 (2014)
Dinkelbach W On nonlinear fractional programming Manag. Sci. 1967 13 492 498 242488 10.1287/mnsc.13.7.492
Gillis N Glineur F A continuous characterization of the maximum-edge biclique problem J. Glob. Optim. 2014 58 439 464 3163534 10.1007/s10898-013-0053-2
Goldberg F Shaked-Monderer N On the maximum angle between copositive matrices Electron. J. Linear Algebra 2014 27 837 850 3312061 10.13001/1081-3810.2842
Gourion D Seeger A Critical angles in polyhedral convex cones: numerical and statistical considerations Math. Program. 2010 123 173 198 2577327 10.1007/s10107-009-0317-2
Grippo L Sciandrone M On the convergence of the block nonlinear gauss-seidel method under convex constraints Oper. Res. Lett. 2000 26 3 127 136 1746833 10.1016/S0167-6377(99)00074-7
Higham NJ Computing a nearest symmetric positive semidefinite matrix Linear Algebra Appl. 1988 103 103 118 943997 10.1016/0024-3795(88)90223-6
Iusem A Seeger A On pairs of vectors achieving the maximal angle of a convex cone Math. Program. 2005 104 501 523 2179248 10.1007/s10107-005-0626-z
McCormick GP Computability of global solutions to factorable nonconvex programs: Part I-Convex underestimating problems Math. Program. 1976 10 1 147 175 10.1007/BF01580665
Montanari A Richard E Non-negative principal component analysis: Message passing algorithms and sharp asymptotics IEEE Trans. Informat. Th. 2016 62 1458 1484 3472260 10.1109/TIT.2015.2457942
de Oliveira W Sessa V Sossa D Computing critical angles between two convex cones J. Optim. Theory Appl. 2024 201 2 866 898 4744372 10.1007/s10957-024-02424-3
Orlitzky M When a maximal angle among cones is nonobtuse Comput. Appl. Math. 2020 39 83 4066648 10.1007/s40314-020-1115-y
Seeger A Sossa D Critical angles between two convex cones I. general theory TOP 2016 24 44 65 3484500 10.1007/s11750-015-0375-y
Seeger A Sossa D Critical angles between two convex cones II. special cases TOP 2016 24 66 87 3484501 10.1007/s11750-015-0382-z
Seeger A Sossa D Cone-constrained singular value problems J. Convex Anal. 2023 30 1285 1306 4675364
Seeger A Sossa D Singular value analysis of linear maps under conic constraints Set-Valued Var. Anal 2023 31 33 4643519 10.1007/s11228-023-00696-x
Seeger, A., Sossa, D.: Singular value problems under nonnegativity constraints. Positivity 27, 46 (2023)
Seeger A Sossa D Pareto singular values of boolean matrices and analysis of bipartite graphs Linear Algebra Appl. 2025 709 164 188 4853490 10.1016/j.laa.2025.01.015
Shaham, E.: maximum biclique benchmark. https://github.com/shahamer/maximum-biclique-benchmark (2019)
Sogi, N., Zhu, R., Xue, J.H., Fukui, K.: Constrained mutual convex cone method for image set based recognition. Pattern Recognit. 121, 108190 (2022)
Yu G Zhang Q The angular spectrum of the 3×3 copositive cone Electron. J. Linear Algebra 2025 41 122 141 4875140 10.13001/ela.2025.8551
Zhang Q The maximal angle between 5×5 positive semidefinite and 5×5 nonnegative matrices Electron. J. Linear Algebra 2021 37 698 708 4363015 10.13001/ela.2021.6647
