Pages that link to "Item:Q5444278"

The following pages link to Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints (Q5444278):

Displaying 32 items.

• Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220) (← links)
• Conic relaxations for semi-supervised support vector machines (Q289094) (← links)
• Sensor network localization, Euclidean distance matrix completions, and graph realization (Q374660) (← links)
• On the accuracy of dual bounds for quadratic extremum problems (Q380649) (← links)
• Tightness of semidefinite programming relaxation to robust transmit beamforming with SINR constraints (Q460032) (← 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 indefinite complex quadratic maximization problems (Q625875) (← links)
• Moment inequalities for sums of random matrices and their applications in optimization (Q647387) (← links)
• On approximating complex quadratic optimization problems via semidefinite programming relaxations (Q877200) (← links)
• New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
• Matrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraint (Q1041439) (← links)
• Approximating global quadratic optimization with convex quadratic constraints (Q1304392) (← links)
• Approximating quadratic programming with bound and quadratic constraints (Q1572673) (← links)
• Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
• Maximization of a PSD quadratic form and factorization (Q2230781) (← links)
• Frequency-hopping code design for Target detection via optimization theory (Q2275335) (← links)
• Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem (Q2311115) (← links)
• Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix (Q2358291) (← links)
• A subgradient-based convex approximations method for DC programming and its applications (Q2358301) (← links)
• Improved design of unimodular waveforms for MIMO radar (Q2393108) (← links)
• Input design for discrimination between classes of LTI models (Q2409415) (← 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)
• (Q2941669) (← links)
• Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints (Q4909732) (← links)
• Probability Bounds for Polynomial Functions in Random Variables (Q5244874) (← links)
• Inhomogeneous polynomial optimization over a convex set: An approximation approach (Q5496212) (← links)
• An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels (Q5746701) (← links)
• A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints (Q6093405) (← links)
• Solving a class of two-stage stochastic nonlinear integer programs using value functions (Q6667707) (← links)