A note on convex relaxations for the inverse eigenvalue problem
From MaRDI portal
Publication:2230796
DOI10.1007/s11590-021-01708-1zbMath1477.90080arXiv1911.02225OpenAlexW3129415631MaRDI QIDQ2230796
Venkat Chandrasekeran, Yong Sheng Soh, Utkan Onur Candogan
Publication date: 28 September 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.02225
semidefinite programmingcombinatorial optimizationreal algebraic geometrysums of squares polynomialsSchur-Horn orbitope
Uses Software
Cites Work
- Unnamed Item
- Application of the alternating direction method for an inverse monic quadratic eigenvalue problem
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Semi-definite programming techniques for structured quadratic inverse eigenvalue problems
- Discrete inverse Sturm-Liouville problems. I: Uniqueness for symmetric potentials
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- Anneaux preordonnes
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Global Optimization with Polynomials and the Problem of Moments
- Graph Implementations for Nonsmooth Convex Programs
- Theta Bodies for Polynomial Ideals
- ORBITOPES
- A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem
- Existence of matrices with prescribed eigenvalues and entries
- A Numerical Method for Solving Inverse Real Symmetric Eigenvalue Problems
- The Formulation and Analysis of Numerical Methods for Inverse Eigenvalue Problems
- A survey of matrix inverse eigenvalue problems
- The Inverse Eigenvalue Problem for Real Symmetric Toeplitz Matrices
- Inverse Eigenvalue Problems
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation
- Semidefinite Optimization and Convex Algebraic Geometry
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
- Inverse eigenvalue problems
This page was built for publication: A note on convex relaxations for the inverse eigenvalue problem