Convex reformulation and polynomial-time algorithm for spectral design problems that update a prior information matrix by rank-one updates under Euclidean-norm bounds on the design vectors.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimal Spectral Design with Prior Information
Convex reformulation and polynomial-time algorithm for spectral design problems that update a prior information matrix by rank-one updates under Euclidean-norm bounds on the design vectors.