Pages that link to "Item:Q3629504"

The following pages link to Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization (Q3629504):

Displaying 32 items.

• Exactness conditions for an SDP relaxation of the extended trust region problem (Q315474) (← links)
• A note on semidefinite programming relaxations for polynomial optimization over a single sphere (Q341317) (← links)
• A counter-example to a conjecture of Ben-Tal, Nemirovski and Roos (Q384218) (← links)
• Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints (Q481050) (← links)
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
• Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← links)
• Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints (Q625653) (← links)
• Approximation algorithms for nonnegative polynomial optimization problems over unit spheres (Q721466) (← links)
• Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints (Q1785385) (← links)
• An exact Jacobian SDP relaxation for polynomial optimization (Q1942264) (← links)
• Small deviations of sums of independent random variables (Q2010615) (← links)
• Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
• A note on random signs (Q2257576) (← links)
• Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem (Q2311115) (← links)
• Tight relaxations for polynomial optimization and Lagrange multiplier expressions (Q2330641) (← links)
• A subgradient-based convex approximations method for DC programming and its applications (Q2358301) (← links)
• An improved probability bound for the approximate S-lemma (Q2467445) (← links)
• Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds (Q2630836) (← links)
• A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
• A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry (Q2808162) (← links)
• Convex Hulls of Quadratically Parameterized Sets With Quadratic Constraints (Q2849467) (← links)
• A new series of conjectures and open questions in optimization and matrix analysis (Q3628305) (← links)
• Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints (Q4909732) (← links)
• Rademacher–Gaussian tail comparison for complex coefficients and related problems (Q5027178) (← links)
• (Q5053241) (← links)
• Probability Bounds for Polynomial Functions in Random Variables (Q5244874) (← links)
• Inhomogeneous polynomial optimization over a convex set: An approximation approach (Q5496212) (← links)
• Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200) (← links)
• An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels (Q5746701) (← links)
• (Q5881787) (← links)
• A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints (Q6093405) (← links)
• Projectively and Weakly Simultaneously Diagonalizable Matrices and their Applications (Q6180358) (← links)