Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
From MaRDI portal
Publication:3629504
DOI10.1137/070679041zbMath1180.90218arXivmath/0701070OpenAlexW2003672952MaRDI QIDQ3629504
Jia-Wang Nie, Zhi-Quan Luo, Simai He, Shu-Zhong Zhang
Publication date: 27 May 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0701070
Related Items
A subgradient-based convex approximations method for DC programming and its applications, Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds, A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, Exactness conditions for an SDP relaxation of the extended trust region problem, A note on semidefinite programming relaxations for polynomial optimization over a single sphere, Approximation algorithms for homogeneous polynomial optimization with quadratic constraints, A counter-example to a conjecture of Ben-Tal, Nemirovski and Roos, A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints, Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints, An exact Jacobian SDP relaxation for polynomial optimization, Projectively and Weakly Simultaneously Diagonalizable Matrices and their Applications, Unnamed Item, Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints, An improved probability bound for the approximate S-lemma, Unnamed Item, Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints, An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints, A note on random signs, Small deviations of sums of independent random variables, An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels, Penalized semidefinite programming for quadratically-constrained quadratic optimization, Approximation algorithms for nonnegative polynomial optimization problems over unit spheres, Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints, A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry, A new series of conjectures and open questions in optimization and matrix analysis, Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem, Inhomogeneous polynomial optimization over a convex set: An approximation approach, Probability Bounds for Polynomial Functions in Random Variables, Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems, Tight relaxations for polynomial optimization and Lagrange multiplier expressions, Convex Hulls of Quadratically Parameterized Sets With Quadratic Constraints, Rademacher–Gaussian tail comparison for complex coefficients and related problems
Uses Software
