Approximation methods for complex polynomial optimization
type: Item
instance of: scholarly article
title: Approximation methods for complex polynomial optimization
zbMATH Open document ID: 1317.90328
author: Bo Jiang
author: Zhening Li
author: Shuzhong Zhang
published in: Computational Optimization and Applications
publication date: 2014-09-18T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 15A69
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6345673
zbMATH Keywords: polynomial optimization
zbMATH Keywords: complex programming
zbMATH Keywords: complex tensor
zbMATH Keywords: approximation algorithm
zbMATH Keywords: tensor relaxation
MaRDI profile type: Publication
full work available at URL: s10589-014-9640-5
OpenAlex ID: W2034356527
cites work: Eigenvalues and invariants of tensors
cites work: Approximating the Cut-Norm via Grothendieck's Inequality
cites work: Handbook on semidefinite, conic and polynomial optimization
cites work: Ambiguity Function Shaping for Cognitive Radar Via Complex Quartic Optimization
cites work: Extended Matrix Cube Theorems with Applications to μ-Theory in Control
cites work: Maximum block improvement and polynomial optimization
cites work: Optimization based scheduling for a class of production systems with integral constraints
cites work: Probability Bounds for Polynomial Functions in Random Variables
cites work: Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
cites work: Inhomogeneous polynomial optimization over a convex set: An approximation approach
cites work: Approximation algorithms for discrete polynomial optimization
cites work: The geometric measure of multipartite entanglement and the singular values of a hypermatrix
cites work: Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems
cites work: Approximation algorithms for indefinite complex quadratic maximization problems
cites work: A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
cites work: Tensor principal component analysis via convex optimization
cites work: Global optimization with polynomials and the problem of moments
cites work: Approximation Methods for Polynomial Optimization
cites work: Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
cites work: Blind constant modulus equalization via convex optimization
cites work: Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
cites work: On approximating complex quadratic optimization problems via semidefinite programming relaxations
cites work: On the complexity of purely complex μ computation and related problems in multidimensional systems
cites work: Complex Quadratic Optimization and Semidefinite Programming
DOI: 10.1007/S10589-014-9640-5
description: scientific article; zbMATH DE number 6345673