Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
From MaRDI portal
Publication:5444278
DOI10.1137/050642691zbMath1156.90011OpenAlexW1978666418MaRDI QIDQ5444278
Nicholas D. Sidiropoulos, Zhi-Quan Luo, Shu-Zhong Zhang, Paul Tseng
Publication date: 25 February 2008
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050642691
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix, A subgradient-based convex approximations method for DC programming and its applications, Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets, Conic relaxations for semi-supervised support vector machines, Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds, A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, Improved design of unimodular waveforms for MIMO radar, Sensor network localization, Euclidean distance matrix completions, and graph realization, Input design for discrimination between classes of LTI models, Approximation algorithms for homogeneous polynomial optimization with quadratic constraints, A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints, 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, Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints, An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints, An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels, Penalized semidefinite programming for quadratically-constrained quadratic optimization, Frequency-hopping code design for Target detection via optimization theory, Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem, Inhomogeneous polynomial optimization over a convex set: An approximation approach, Matrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraint, Probability Bounds for Polynomial Functions in Random Variables
