Pages that link to "Item:Q1968792"

The following pages link to On maximization of quadratic form over intersection of ellipsoids with common center (Q1968792):

Displaying 47 items.

• Approximating the little Grothendieck problem over the orthogonal and unitary groups (Q344957) (← links)
• Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints (Q481050) (← links)
• A class of semidefinite programs with rank-one solutions (Q551300) (← 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)
• Sums of random symmetric matrices and quadratic optimization under orthogonality constraints (Q868470) (← links)
• On approximating complex quadratic optimization problems via semidefinite programming relaxations (Q877200) (← links)
• A \({\mathsf{D}}\)-induced duality and its applications (Q925269) (← links)
• Approximating the weighted maximin dispersion problem over an \(\ell _p\)-ball: SDP relaxation is misleading (Q1653283) (← links)
• Global optimization in Hilbert space (Q1717227) (← links)
• Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
• Near-optimality of linear recovery from indirect observations (Q1739121) (← links)
• Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints (Q1785385) (← links)
• Ellipsoidal bounds for uncertain linear equations and dynamical systems (Q1879588) (← links)
• Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
• Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension (Q2045012) (← links)
• The \(\ell^p\)-Gaussian-Grothendieck problem with vector spins (Q2149938) (← 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 design of unimodular waveforms for MIMO radar (Q2393108) (← links)
• Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
• Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds (Q2630836) (← links)
• Computation of the phase and gain margins of MIMO control systems (Q2681387) (← links)
• Computational methods for solving nonconvex block-separable constrained quadratic problems (Q2810546) (← links)
• Grothendieck-type inequalities in combinatorial optimization (Q2892967) (← links)
• Jordan-algebraic aspects of optimization: randomization (Q3161141) (← links)
• Approximate Kernel Clustering (Q3400770) (← links)
• Detecting redundancy in optimization problems over intersection of ellipsoids (Q4465477) (← links)
• On the Stationary Points of the Squared Distance between Two Ellipses with a Common Focus (Q4785912) (← links)
• Fast Heuristics and Approximation Algorithms (Q5050148) (← links)
• Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints (Q5060505) (← links)
• A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity (Q5084603) (← links)
• A Greedy Algorithm for Subspace Approximation Problem (Q5116494) (← links)
• Semidefinite relaxation for the total least squares problem with Tikhonov-like regularization (Q5151536) (← links)
• Grothendieck’s Theorem, past and present (Q5389600) (← links)
• Inhomogeneous polynomial optimization over a convex set: An approximation approach (Q5496212) (← links)
• (Q5743431) (← links)
• An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels (Q5746701) (← links)
• Quadratic forms on graphs (Q5896810) (← links)
• LMI approximations for the radius of the intersection of ellipsoids: Survey. (Q5929424) (← links)
• A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints (Q6093405) (← links)
• Tight computationally efficient approximation of matrix norms with applications (Q6114892) (← links)
• Variational characterization and Rayleigh quotient iteration of 2D eigenvalue problem with applications (Q6592217) (← links)
• Solving two-trust-region subproblems using semidefinite optimization with eigenvector branching (Q6596338) (← links)