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