A Fast Matrix Majorization-Projection Method for Penalized Stress Minimization With Box Constraints

DOI10.1109/TSP.2018.2849734zbMath1414.90260OpenAlexW2809824420WikidataQ129601577 ScholiaQ129601577MaRDI QIDQ4622329

Sheng-Long Zhou, Nai-Hua Xiu, Hou-Duo Qi

Publication date: 12 February 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsp.2018.2849734

Mathematics Subject Classification ID

Semidefinite programming (90C22) Deterministic network models in operations research (90B10)

Related Items (9)

An Ordinal Weighted EDM Model for Nonmetric Multidimensional Scaling ⋮ Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints ⋮ A facial reduction approach for the single source localization problem ⋮ Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds ⋮ Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications ⋮ A majorization penalty method for SVM with sparse constraint ⋮ Robust Euclidean embedding via EDM optimization ⋮ Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers ⋮ A penalized method of alternating projections for weighted low-rank Hankel matrix optimization

This page was built for publication: A Fast Matrix Majorization-Projection Method for Penalized Stress Minimization With Box Constraints