Name
Title | ||
|---|---|---|
A Fast Matrix Majorization-Projection Method for Penalized Stress Minimization With Box Constraints. |
Abstract | ||
|---|---|---|
Kruskal's stress minimization, though nonconvex and nonsmooth, has been a major computational model for dissimilarity data in multidimensional scaling. Semidefinite programming (SDP) relaxation (by dropping the rank constraint) would lead to a high number of SDP cone constraints. This has rendered the SDP approach computationally challenging even for problems of small size. In this paper, we refor... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TSP.2018.2849734 | IEEE Transactions on Signal Processing |
Keywords | Field | DocType |
Stress,Minimization,Signal processing algorithms,Optimization,Computational modeling,Euclidean distance | Convergence (routing),Mathematical optimization,Matrix (mathematics),Euclidean distance,Projection method,Stationary point,Kruskal's algorithm,Semidefinite programming,Euclidean distance matrix,Mathematics | Journal |
Volume | Issue | ISSN |
66 | 16 | 1053-587X |
Citations | PageRank | References |
1 | 0.36 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shenglong Zhou | 1 | 3 | 1.77 |
| Naihua Xiu | 2 | 142 | 22.48 |
| Houduo Qi | 3 | 437 | 32.91 |