On the public citation graph
On maximization of quadratic form over intersection of ellipsoids with common center
0 signed · 150 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4613-0303-9_24openalex-snapshot
Semidefinite Relaxations, Multivariate Normal Distributions, and Order Statistics
inferredcites →https://doi.org/10.1080/10556789808805690openalex-snapshot
Semidefinite relaxation and nonconvex quadratic optimization
inferredcites →https://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4821892openalex-extracted
An Algorithm for Global Minimization of Non-Convex Functions
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0755openalex-snapshot
Semidefinite Optimization Applications
inferred← citeshttps://doi.org/10.1002/cpa.21398openalex-snapshot
Grothendieck‐Type Inequalities in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1002/nla.2430openalex-snapshot
A Newton‐type method for two‐dimensional eigenvalue problems
inferred← citeshttps://doi.org/10.1007/11496915_10openalex-snapshot
On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations
inferred← citeshttps://doi.org/10.1007/978-0-387-35699-0_1openalex-snapshot
On Approximate Robust Counterparts of Uncertain Semidefinite and Conic Quadratic Programs
inferred← citeshttps://doi.org/10.1007/978-1-4614-3984-4_2openalex-snapshot
Polynomial Optimization Over the Euclidean Ball
inferred← citeshttps://doi.org/10.1007/978-1-4614-3984-4_3openalex-snapshot
Extensions of the Constraint Sets
inferred← citeshttps://doi.org/10.1007/978-3-031-04520-2_8openalex-snapshot
Fast Heuristics and Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-94667-2_31openalex-snapshot
How Far From a Worst Solution a Random Solution of a $$k\,$$CSP Instance Can Be?
inferred← citeshttps://doi.org/10.1007/978-3-540-45198-3_16openalex-snapshot
An Improved Algorithm for Approximating the Radii of Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-15582-6_46openalex-snapshot
Removing Redundant Quadratic Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_10openalex-snapshot
On Quadratic Programming with a Ratio Objective
inferred← citeshttps://doi.org/10.1007/s00186-023-00827-yopenalex-snapshot
A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints
inferred← citeshttps://doi.org/10.1007/s10107-006-0033-0openalex-snapshot
Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
inferred← citeshttps://doi.org/10.1007/s10107-006-0064-6openalex-snapshot
On approximating complex quadratic optimization problems via semidefinite programming relaxations
inferred← citeshttps://doi.org/10.1007/s10107-007-0097-5openalex-snapshot
A $${\mathsf{D}}$$-induced duality and its applications
inferred← citeshttps://doi.org/10.1007/s10107-009-0330-5openalex-snapshot
Moment inequalities for sums of random matrices and their applications in optimization
inferred← citeshttps://doi.org/10.1007/s10107-010-0409-zopenalex-snapshot
Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
inferred← citeshttps://doi.org/10.1007/s10107-012-0515-1openalex-snapshot
Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
inferred← citeshttps://doi.org/10.1007/s10107-016-0993-7openalex-snapshot
Approximating the little Grothendieck problem over the orthogonal and unitary groups
inferred← citeshttps://doi.org/10.1007/s10107-017-1215-7openalex-snapshot
Global optimization in Hilbert space
inferred← citeshttps://doi.org/10.1007/s10898-010-9545-5openalex-snapshot
Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
inferred← citeshttps://doi.org/10.1007/s10898-020-00985-xopenalex-snapshot
Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
inferred← citeshttps://doi.org/10.1007/s10957-014-0538-2openalex-snapshot
Approximation Bounds for Trilinear and Biquadratic Optimization Problems Over Nonconvex Constraints
inferred← citeshttps://doi.org/10.1007/s10957-018-1416-0openalex-snapshot
Enhancing Semidefinite Relaxation for Quadratically Constrained Quadratic Programming via Penalty Methods
inferred← citeshttps://doi.org/10.1007/s10957-019-01558-zopenalex-snapshot
Frequency-Hopping Code Design for Target Detection via Optimization Theory
inferred← citeshttps://doi.org/10.1007/s11045-011-0171-2openalex-snapshot
Improved design of unimodular waveforms for MIMO radar
inferred← citeshttps://doi.org/10.1007/s11425-007-0080-xopenalex-snapshot
Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation
inferred← citeshttps://doi.org/10.1007/s11425-010-0087-6openalex-snapshot
Approximation algorithms for indefinite complex quadratic maximization problems
inferred← citeshttps://doi.org/10.1007/s11425-010-3087-7openalex-snapshot
Approximation algorithms for indefinite complex quadratic maximization problems
inferred← citeshttps://doi.org/10.1007/s11590-017-1177-yopenalex-snapshot
Approximating the weighted maximin dispersion problem over an $$\ell _p$$ ℓ p -ball: SDP relaxation is misleading
inferred← citeshttps://doi.org/10.1007/s11590-018-1283-5openalex-snapshot
Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem
inferred← citeshttps://doi.org/10.1007/s40305-013-0017-8openalex-snapshot
An Approximation Bound Analysis for Lasserre’s Relaxation in Multivariate Polynomial Optimization
inferred← citeshttps://doi.org/10.1007/s40305-015-0082-2openalex-snapshot
Semidefinite Relaxation for Two Mixed Binary Quadratically Constrained Quadratic Programs: Algorithms and Approximation Bounds
inferred← citeshttps://doi.org/10.1016/j.amc.2012.11.022openalex-snapshot
Rank-one solutions for homogeneous linear matrix equations over the positive semidefinite cone
inferred← citeshttps://doi.org/10.1016/j.automatica.2004.01.001openalex-snapshot
Ellipsoidal bounds for uncertain linear equations and dynamical systems
inferred← citeshttps://doi.org/10.1016/j.automatica.2022.110846openalex-snapshot
Computation of the phase and gain margins of MIMO control systems
inferred← citeshttps://doi.org/10.1016/j.ifacol.2020.12.564openalex-snapshot
Multivariable Experiment Design with Application to a Wafer Stage: a Sequential Relaxation Approach for Dealing with Element-Wise Constraints
inferred← citeshttps://doi.org/10.1016/j.ifacol.2023.10.1881openalex-snapshot
Gain-Phase Margin of MIMO Control Systems
inferred← citeshttps://doi.org/10.1016/j.laa.2011.03.027openalex-snapshot
A class of semidefinite programs with rank-one solutions
inferred← citeshttps://doi.org/10.1016/j.mechatronics.2020.102440openalex-snapshot
Frequency Response Function identification for multivariable motion control: Optimal experiment design with element-wise constraints
inferred← citeshttps://doi.org/10.1016/j.orl.2015.05.002openalex-snapshot
Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints
inferred← citeshttps://doi.org/10.1016/j.sigpro.2014.12.015openalex-snapshot
On geometric upper bounds for positioning algorithms in wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115896openalex-snapshot
From worst case to the average: Structural guarantees in k-CSP approximation via orthogonal arrays
inferred← citeshttps://doi.org/10.1016/s0024-3795(99)00205-0openalex-snapshot
Strong duality for a trust-region type relaxation of the quadratic assignment problem
inferred← citeshttps://doi.org/10.1017/cbo9780511921735openalex-snapshot
The Design of Approximation Algorithms
inferred← citeshttps://doi.org/10.1023/a:1008370723217openalex-snapshot
Approximating Global Quadratic Optimization with Convex Quadratic Constraints
inferred← citeshttps://doi.org/10.1023/a:1026454804250openalex-snapshot
LMI Approximations for the Radius of the Intersection of Ellipsoids: Survey
inferred← citeshttps://doi.org/10.1039/d3nr02425copenalex-snapshot
Computational approach for structure generation of anisotropic particles (CASGAP) with targeted distributions of particle design and orientational order
inferred← citeshttps://doi.org/10.1080/02331934.2019.1711080openalex-snapshot
Semidefinite relaxation for the total least squares problem with Tikhonov-like regularization
inferred← citeshttps://doi.org/10.1080/09720502.2002.10700315openalex-snapshot
Detecting redundancy in optimization problems over intersection of ellipsoids
inferred← citeshttps://doi.org/10.1080/10556780903033771openalex-snapshot
Jordan-algebraic aspects of optimization: randomization
inferred← citeshttps://doi.org/10.1080/10556788.2012.711330openalex-snapshot
An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels
inferred← citeshttps://doi.org/10.1088/1361-6560/aa641bopenalex-snapshot
On the estimation of the worst-case implant-induced RF-heating in multi-channel MRI
inferred← citeshttps://doi.org/10.1090/s0025-5718-2014-02875-5openalex-snapshot
Inhomogeneous polynomial optimization over a convex set: An approximation approach
inferred← citeshttps://doi.org/10.1090/s0273-0979-2011-01348-9openalex-snapshot
Grothendieck’s Theorem, past and present
inferred← citeshttps://doi.org/10.1093/imrn/rnab311openalex-snapshot
On ℓp-Gaussian–Grothendieck Problem
inferred← citeshttps://doi.org/10.1109/acc.2015.7172269openalex-snapshot
Acyclic semidefinite approximations of quadratically constrained quadratic programs
inferred← citeshttps://doi.org/10.1109/acc.2016.7525216openalex-snapshot
Semidefinite relaxations in optimal experiment design with application to substrate injection for hyperpolarized MRI
inferred← citeshttps://doi.org/10.1109/access.2019.2894873openalex-snapshot
Linear Precoder Design for SWIPT With Finite-Alphabet Inputs and Statistical CSI
inferred← citeshttps://doi.org/10.1109/access.2020.2965218openalex-snapshot
UCAA: User-Centric User Association and Resource Allocation in Fog Computing Networks
inferred← citeshttps://doi.org/10.1109/cdc.1998.758550openalex-snapshot
LMI approximations for the radius of the intersection of ellipsoids
inferred← citeshttps://doi.org/10.1109/cdc.2003.1271805openalex-snapshot
Orthotopic and ellipsoidal simulations for a class of non-linear systems
inferred← citeshttps://doi.org/10.1109/cdc.2010.5717097openalex-snapshot
Input design for system identification via convex relaxation
inferred← citeshttps://doi.org/10.1109/focs.2006.67openalex-snapshot
SDP gaps and UGC-hardness for MAXCUTGAIN
inferred← citeshttps://doi.org/10.1109/focs.2007.36openalex-snapshot
Strongly History-Independent Hashing with Applications
inferred← citeshttps://doi.org/10.1109/focs.2007.4389503openalex-snapshot
Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies
inferred← citeshttps://doi.org/10.1109/focs.2011.62openalex-snapshot
A Two Prover One Round Game with Strong Soundness
inferred← citeshttps://doi.org/10.1109/icassp43922.2022.9747038openalex-snapshot
Delta Distancing: A Lifting Approach to Localizing Items from User Comparisons
inferred← citeshttps://doi.org/10.1109/icc.2010.5502731openalex-snapshot
Pre-Equalization for DS-UWB Systems with Spectral Mask Constraints
inferred← citeshttps://doi.org/10.1109/icc.2012.6363663openalex-snapshot
On interference-aware precoding for multi-antenna channels with finite-alphabet inputs
inferred← citeshttps://doi.org/10.1109/icc.2013.6655013openalex-snapshot
Feedback interference alignment: Exact alignment for three users in two time slots
inferred← citeshttps://doi.org/10.1109/icc.2016.7511633openalex-snapshot
Global optimization of precoder for multi-antenna secure cognitive radios with finite-alphabet inputs and statistical CSI
inferred← citeshttps://doi.org/10.1109/isit.2012.6283552openalex-snapshot
The minimax risk of truncated series estimators for symmetric convex polytopes
inferred← citeshttps://doi.org/10.1109/jsac.2011.110209openalex-snapshot
Optimal Spectrum Sharing in MIMO Cognitive Radio Networks via Semidefinite Programming
inferred← citeshttps://doi.org/10.1109/jsac.2012.121103openalex-snapshot
Globally Optimal Precoder Design with Finite-Alphabet Inputs for Cognitive Radio Networks
inferred← citeshttps://doi.org/10.1109/jsac.2013.131005openalex-snapshot
Joint User Grouping and Linear Virtual Beamforming: Complexity, Algorithms and Approximation Bounds
inferred← citeshttps://doi.org/10.1109/msp.2010.936019openalex-snapshot
Semidefinite Relaxation of Quadratic Optimization Problems
inferred← citeshttps://doi.org/10.1109/pic.2010.5687988openalex-snapshot
Some results on semidefinite programming with rank constraint
inferred← citeshttps://doi.org/10.1109/sam.2004.1502996openalex-snapshot
Broadcasting with channel state information
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181980openalex-snapshot
On approximating the radii of point sets in high dimensions
inferred← citeshttps://doi.org/10.1109/sfcs.2005.57openalex-snapshot
On Non-Approximability for Quadratic Programs
inferred← citeshttps://doi.org/10.1109/ssp.2018.8450861openalex-snapshot
Multi-Branch Binary Modulation Sequences For Interferer Rejection
inferred← citeshttps://doi.org/10.1109/tac.2003.811257openalex-snapshot
Set simulations for quadratic systems
inferred← citeshttps://doi.org/10.1109/tcomm.2011.122110.090718openalex-snapshot
Pre-Equalization for Pre-Rake DS-UWB Systems with Spectral Mask Constraints
inferred← citeshttps://doi.org/10.1109/tsg.2017.2729082openalex-snapshot
Rank-One Solutions for SDP Relaxation of QCQPs in Power Systems
inferred← citeshttps://doi.org/10.1109/tsp.2006.872578openalex-snapshot
Transmit beamforming for physical-layer multicasting
inferred← citeshttps://doi.org/10.1109/tsp.2009.2031732openalex-snapshot
Rank-Constrained Separable Semidefinite Programming With Applications to Optimal Beamforming
inferred← citeshttps://doi.org/10.1109/tsp.2011.2128313openalex-snapshot
Design of Optimized Radar Codes With a Peak to Average Power Ratio Constraint
inferred← citeshttps://doi.org/10.1109/tsp.2013.2297683openalex-snapshot
Randomized Algorithms for Optimal Solutions of Double-Sided QCQP With Applications in Signal Processing
inferred← citeshttps://doi.org/10.1109/tvt.2016.2590539openalex-snapshot
Linear Precoding for Fading Cognitive Multiple-Access Wiretap Channel With Finite-Alphabet Inputs
inferred← citeshttps://doi.org/10.1109/tvt.2016.2619418openalex-snapshot
Joint Source and Relay Precoding in Multiantenna Millimeter-Wave Systems
inferred← citeshttps://doi.org/10.1109/twc.2016.2515090openalex-snapshot
Multiantenna Secure Cognitive Radio Networks With Finite-Alphabet Inputs: A Global Optimization Approach for Precoder Design
inferred← citeshttps://doi.org/10.1109/wcnc.2017.7925807openalex-snapshot
Precoder Design for Simultaneous Wireless Information and Power Transfer with Finite-Alphabet Inputs
inferred← citeshttps://doi.org/10.1109/wsa.2010.5456440openalex-snapshot
Optimal MISO UWB pre-equalizer design with spectral mask constraints
inferred← citeshttps://doi.org/10.1112/s002557930000098xopenalex-snapshot
Approximate Kernel Clustering
inferred← citeshttps://doi.org/10.1137/050627472openalex-snapshot
Approximating the Radii of Point Sets
inferred← citeshttps://doi.org/10.1137/050642691openalex-snapshot
Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
inferred← citeshttps://doi.org/10.1137/070679041openalex-snapshot
Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
inferred← citeshttps://doi.org/10.1137/070691140openalex-snapshot
Linear Equations Modulo 2 and the $L_1$ Diameter of Convex Bodies
inferred← citeshttps://doi.org/10.1137/090772952openalex-snapshot
A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
inferred← citeshttps://doi.org/10.1137/1.9781611973099.58openalex-snapshot
Bypassing UGC from some Optimal Geometric Inapproximability Results
inferred← citeshttps://doi.org/10.1137/130909597openalex-snapshot
Semidefinite Approximation for Mixed Binary Quadratically Constrained Quadratic Programs
inferred← citeshttps://doi.org/10.1137/140976856openalex-snapshot
Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems
inferred← citeshttps://doi.org/10.1137/22m1472589openalex-snapshot
Variational Characterization and Rayleigh Quotient Iteration of 2D Eigenvalue Problem with Applications
inferred← citeshttps://doi.org/10.1137/s105262340139001xopenalex-snapshot
New Results on Quadratic Minimization
inferred← citeshttps://doi.org/10.1137/s1052623401395899openalex-snapshot
Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
inferred← citeshttps://doi.org/10.1145/2737729openalex-snapshot
Bypassing UGC from Some Optimal Geometric Inapproximability Results
inferred← citeshttps://doi.org/10.1145/2897518.2897548openalex-snapshot
Semidefinite programs on sparse random graphs and their application to community detection
inferred← citeshttps://doi.org/10.1145/3519935.3519960openalex-snapshot
Optimizing strongly interacting fermionic Hamiltonians
inferred← citeshttps://doi.org/10.1145/777792.777799openalex-snapshot
High-dimensional shape fitting in linear time
inferred← citeshttps://doi.org/10.1186/1687-6180-2014-4openalex-snapshot
Upper bounds on position error of a single location estimate in wireless sensor networks
inferred← citeshttps://doi.org/10.1214/22-ejp801openalex-snapshot
The ℓp-Gaussian-Grothendieck problem with vector spins
inferred← citeshttps://doi.org/10.1287/ijoc.2020.1017openalex-snapshot
A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity
inferred← citeshttps://doi.org/10.1287/moor.1080.0326openalex-snapshot
A Unified Theorem on SDP Rank Reduction
inferred← citeshttps://doi.org/10.1287/moor.1090.0425openalex-snapshot
The UGC Hardness Threshold of the L p Grothendieck Problem
inferred← citeshttps://doi.org/10.1287/opre.2021.2182openalex-snapshot
Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
inferred← citeshttps://doi.org/10.3390/a14030088openalex-snapshot
Union and Intersection Operators for Thick Ellipsoid State Enclosures: Application to Bounded-Error Discrete-Time State Observer Design
inferred← citeshttps://doi.org/10.4236/apm.2017.74018openalex-snapshot
An Effective Algorithm for Quadratic Optimization with Non-Convex Inhomogeneous Quadratic Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.0807.4626openalex-snapshot
Approximate kernel clustering
inferred← citeshttps://doi.org/10.48550/arxiv.1201.2513openalex-snapshot
On Geometric Upper Bounds for Positioning Algorithms in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1606.06421openalex-snapshot
Approximation of the weighted maximin dispersion problem over Lp-ball: SDP relaxation is misleading
inferred← citeshttps://doi.org/10.48550/arxiv.1610.05862openalex-snapshot
Interval Superposition Arithmetic
inferred← citeshttps://doi.org/10.48550/arxiv.1804.00106openalex-snapshot
On Equivalence and Computational Efficiency of the Major Relaxation Methods for Minimum Ellipsoid Containing the Intersection of Ellipsoids
inferred← citeshttps://doi.org/10.48550/arxiv.1811.05873openalex-snapshot
Design of Spectrally Shaped Binary Sequences via Randomized Convex Relaxation
inferred← citeshttps://doi.org/10.48550/arxiv.2003.07345openalex-snapshot
Symmetric Grothendieck inequality
inferred← citeshttps://doi.org/10.48550/arxiv.2012.09343openalex-snapshot
On $\ell_p$-Gaussian-Grothendieck problem
inferred← citeshttps://doi.org/10.48550/arxiv.math/0701070openalex-snapshot
Semidefnite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
inferred← citeshttps://doi.org/10.5555/1109557.1109686openalex-snapshot
Correlation clustering with a fixed number of clusters
inferred← citeshttps://doi.org/10.5555/1496770.1496828openalex-snapshot
Towards computing the Grothendieck constant
inferred← citeshttps://doi.org/10.5555/1496770.1496900openalex-snapshot
Improved approximation bound for quadratic optimization problems with orthogonality constraints
inferred← citeshttps://doi.org/10.5802/ojmo.19openalex-snapshot
Tight computationally efficient approximation of matrix norms with applications
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.