Approximation methods for complex polynomial optimization
From MaRDI portal
Publication:742305
DOI10.1007/s10589-014-9640-5zbMath1317.90328OpenAlexW2034356527MaRDI QIDQ742305
Bo Jiang, Zhening Li, Shu-Zhong Zhang
Publication date: 18 September 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-014-9640-5
Integer programming (90C10) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Multilinear algebra, tensor calculus (15A69)
Related Items
A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables, Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables, On decompositions and approximations of conjugate partial-symmetric tensors, Approximation algorithms for optimization of real-valued general conjugate complex forms, Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations
Cites Work
- Approximation algorithms for discrete polynomial optimization
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Optimization based scheduling for a class of production systems with integral constraints
- Approximation algorithms for indefinite complex quadratic maximization problems
- Handbook on semidefinite, conic and polynomial optimization
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Eigenvalues and invariants of tensors
- On approximating complex quadratic optimization problems via semidefinite programming relaxations
- Tensor principal component analysis via convex optimization
- Global Optimization with Polynomials and the Problem of Moments
- Maximum Block Improvement and Polynomial Optimization
- A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- On the complexity of purely complex μ computation and related problems in multidimensional systems
- Ambiguity Function Shaping for Cognitive Radar Via Complex Quartic Optimization
- Probability Bounds for Polynomial Functions in Random Variables
- Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems
- The geometric measure of multipartite entanglement and the singular values of a hypermatrix
- Blind constant modulus equalization via convex optimization
- Approximation Methods for Polynomial Optimization
- Complex Quadratic Optimization and Semidefinite Programming
- Approximating the Cut-Norm via Grothendieck's Inequality
- Inhomogeneous polynomial optimization over a convex set: An approximation approach
- Extended Matrix Cube Theorems with Applications to μ-Theory in Control
