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

DOI10.1007/S101070050100zbMATH Open0944.90056OpenAlexW1970670479MaRDI QIDQ1968792FDOQ1968792

C. Roos, Tamás Terlaky, Arkadi Nemirovski

Publication date: 26 June 2000

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070050100

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

zbMATH Keywords

quadratic programmingsemidefinite relaxations

Mathematics Subject Classification ID

Quadratic programming (90C20) Applications of mathematical programming (90C90) Semidefinite programming (90C22)

Cited In (46)

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

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)