Connecting optimization with spectral analysis of tri-diagonal matrices

DOI10.1007/s10107-020-01549-3OpenAlexW3048094255MaRDI QIDQ2235164

Jean-Bernard Lasserre

Publication date: 20 October 2021

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.09784

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Toeplitz operators, Hankel operators, Wiener-Hopf operators (47B35)

Related Items

Sum of Squares Bounds for the Empty Integral Hull Problem

Cites Work

• Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
• Computing the eigenvalues of symmetric tridiagonal matrices via a Cayley transformation
• Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization
• Evaluation of small elements of the eigenvectors of certain symmetric tridiagonal matrices with high relative accuracy
• Explicit formula for the inverse of a tridiagonal matrix by backward continued fractions
• Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization
• Bounding the support of a measure from its marginal moments
• A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
• Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube
• Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing
• Extremal Properties of Balanced Tri-Diagonal Matrices
• The inverse of a tridiagonal matrix
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item