On maximization of quadratic form over intersection of ellipsoids with common center
From MaRDI portal
Publication:1968792
DOI10.1007/s101070050100zbMath0944.90056OpenAlexW1970670479MaRDI QIDQ1968792
Cornelis 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
Semidefinite programming (90C22) Applications of mathematical programming (90C90) Quadratic programming (90C20)
Related Items
Ellipsoidal bounds for uncertain linear equations and dynamical systems, Jordan-algebraic aspects of optimization: randomization, Grothendieck-Type Inequalities in Combinatorial Optimization, Fast Heuristics and Approximation Algorithms, Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds, Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints, The \(\ell^p\)-Gaussian-Grothendieck problem with vector spins, Approximating the weighted maximin dispersion problem over an \(\ell _p\)-ball: SDP relaxation is misleading, Approximating the little Grothendieck problem over the orthogonal and unitary groups, Improved design of unimodular waveforms for MIMO radar, Sums of random symmetric matrices and quadratic optimization under orthogonality constraints, A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity, On approximating complex quadratic optimization problems via semidefinite programming relaxations, Approximation algorithms for homogeneous polynomial optimization with quadratic constraints, A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints, Computation of the phase and gain margins of MIMO control systems, 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, Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization, Moment inequalities for sums of random matrices and their applications in optimization, Global optimization in Hilbert space, A \({\mathsf{D}}\)-induced duality and its applications, Grothendieck’s Theorem, past and present, Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods, Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints, Near-optimality of linear recovery from indirect observations, Quadratic forms on graphs, Semidefinite relaxation for the total least squares problem with Tikhonov-like regularization, Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation, LMI approximations for the radius of the intersection of ellipsoids: Survey., A class of semidefinite programs with rank-one solutions, An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels, Frequency-hopping code design for Target detection via optimization theory, Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints, Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension, Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems, Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem, Detecting redundancy in optimization problems over intersection of ellipsoids, Approximate Kernel Clustering, Inhomogeneous polynomial optimization over a convex set: An approximation approach, A Greedy Algorithm for Subspace Approximation Problem, Unnamed Item
