On maximization of quadratic form over intersection of ellipsoids with common center

Recommendations

On wellposedness of quadratic function minimization problem on intersection of two ellipsoids
On minimizing the ratio of quadratic functions over an ellipsoid
Maximization of a positive definite quadratic form on a polyhedron
On Chebyshev center of the intersection of two ellipsoids
On well-posedness of quadratic minimization problem on ellipsoid and polyhedron
Ellipsoid bounds for convex quadratic integer programming
An extremal problem on non-overlapping domains containing ellipse points
A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
scientific article; zbMATH DE number 2157773
Extensions on ellipsoid bounds for quadratic integer programming

Cited in

(48)

Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
Grothendieck’s Theorem, past and present
Variational characterization and Rayleigh quotient iteration of 2D eigenvalue problem with applications
A class of semidefinite programs with rank-one solutions
Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
Grothendieck-type inequalities in combinatorial optimization
Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints
Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem
Approximating the little Grothendieck problem over the orthogonal and unitary groups
scientific article; zbMATH DE number 7053310 (Why is no real title available?)
Approximate kernel clustering
Approximation algorithms for indefinite complex quadratic maximization problems
Moment inequalities for sums of random matrices and their applications in optimization
A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity
On Chebyshev center of the intersection of two ellipsoids
Improved design of unimodular waveforms for MIMO radar
Approximating the weighted maximin dispersion problem over an \(\ell _p\)-ball: SDP relaxation is misleading
Maximization of a PSD quadratic form and factorization
Inhomogeneous polynomial optimization over a convex set: an approximation approach
Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
Frequency-hopping code design for Target detection via optimization theory
An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels
Fast heuristics and approximation algorithms
Quadratic forms on graphs
A greedy algorithm for subspace approximation problem
Jordan-algebraic aspects of optimization: randomization
Global optimization in Hilbert space
Computational methods for solving nonconvex block-separable constrained quadratic problems
Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation
Detecting redundancy in optimization problems over intersection of ellipsoids
Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
Solving two-trust-region subproblems using semidefinite optimization with eigenvector branching
Ellipsoidal bounds for uncertain linear equations and dynamical systems
Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds
Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints
Near-optimality of linear recovery from indirect observations
Computation of the phase and gain margins of MIMO control systems
Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints
On approximating complex quadratic optimization problems via semidefinite programming relaxations
Tight computationally efficient approximation of matrix norms with applications
The \(\ell^p\)-Gaussian-Grothendieck problem with vector spins
A \({\mathsf{D}}\)-induced duality and its applications
Semidefinite relaxation for the total least squares problem with Tikhonov-like regularization
LMI approximations for the radius of the intersection of ellipsoids: Survey.
On the Stationary Points of the Squared Distance between Two Ellipses with a Common Focus

This page was built for publication: On maximization of quadratic form over intersection of ellipsoids with common center

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1968792)