| Publication | Date of Publication | Type |
|---|
An NEPv approach for orthogonal CCA with matrix \((2, 1)\)-norm regularization with application to feature selection
Journal of Optimization Theory and Applications | 2026-01-15 | Paper |
Sparse PCA via matrix \(( 2, 1 )\)-norm regularization with an application to feature selection
Results in Applied Mathematics | 2026-01-06 | Paper |
Trace ratio optimization with an application to multi-view learning
Mathematical Programming. Series A. Series B | 2023-08-01 | Paper |
| scientific article; zbMATH DE number 7668290 (Why is no real title available?) | 2023-03-27 | Paper |
scientific article; zbMATH DE number 7668290 (Why is no real title available?)
(available as arXiv preprint) | 2023-03-27 | Paper |
A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices
Optimization Methods & Software | 2022-12-20 | Paper |
Maximizing sum of coupled traces with applications
Numerische Mathematik | 2022-11-15 | Paper |
On generalizing trace minimization principles
Linear Algebra and its Applications | 2022-11-08 | Paper |
| Low Rank Tensor Decompositions and Approximations | 2022-08-15 | Paper |
A self-consistent-field iteration for MAXBET with an application to multi-view feature extraction
Advances in Computational Mathematics | 2022-04-11 | Paper |
A Lagrange multiplier expression method for bilevel polynomial optimization
SIAM Journal on Optimization | 2021-10-26 | Paper |
| On Generalizing Trace Minimization | 2021-04-01 | Paper |
Orthogonal canonical correlation analysis and applications
Optimization Methods & Software | 2020-11-19 | Paper |
Spectral norm of a symmetric tensor and its computation
Mathematics of Computation | 2020-06-15 | Paper |
Matching Pursuit LASSO Part I: Sparse Recovery Over Big Dictionary
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
Matching Pursuit LASSO Part II: Applications and Sparse Recovery Over Batch Signals
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
Bilevel polynomial programs and semidefinite relaxation methods
SIAM Journal on Optimization | 2017-08-18 | Paper |
A unified probabilistic framework for robust manifold learning and embedding
Machine Learning | 2017-08-15 | Paper |
| Geometric measure of entanglement of symmetric d-qubits is polynomial-time computable | 2016-08-03 | Paper |
Semidefinite relaxations for best rank-1 tensor approximations
SIAM Journal on Matrix Analysis and Applications | 2014-12-17 | Paper |
| scientific article; zbMATH DE number 6378115 (Why is no real title available?) | 2014-12-08 | Paper |
scientific article; zbMATH DE number 6378115 (Why is no real title available?)
(available as arXiv preprint) | 2014-12-08 | Paper |
Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
Journal of Global Optimization | 2014-09-18 | Paper |
Semidefinite relaxations for semi-infinite polynomial programming
Computational Optimization and Applications | 2014-05-23 | Paper |
A new trust-region algorithm for finite minimax problems
Journal of Computational Mathematics | 2013-01-24 | Paper |
Regularization methods for SDP relaxations in large-scale polynomial optimization
SIAM Journal on Optimization | 2012-09-12 | Paper |
