Inhomogeneous polynomial optimization over a convex set: An approximation approach
From MaRDI portal
Publication:5496212
DOI10.1090/S0025-5718-2014-02875-5zbMath1308.90134OpenAlexW2006614803MaRDI QIDQ5496212
Zhening Li, Simai He, Shu-Zhong Zhang
Publication date: 30 January 2015
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-2014-02875-5
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Complexity and performance of numerical algorithms (65Y20) Multilinear algebra, tensor calculus (15A69)
Related Items
On decompositions and approximations of conjugate partial-symmetric tensors, On cones of nonnegative quartic forms, Approximation methods for complex polynomial optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization
- Approximation algorithms for discrete polynomial optimization
- Partitioning procedure for polynomial optimization
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Eigenvalues and invariants of tensors
- A tensor product matrix approximation problem in quantum physics
- Global optimization of higher order moments in portfolio selection
- Approximating global quadratic optimization with convex quadratic constraints
- Multivariate polynomial minimization and its application in signal processing
- Semidefinite programming relaxations for semialgebraic problems
- Approximating quadratic programming with bound and quadratic constraints
- Quadratic maximization and semidefinite relaxation
- On maximization of quadratic form over intersection of ellipsoids with common center
- Optimization theory and methods. Nonlinear programming
- Extrema of a real polynomial
- Global Optimization with Polynomials and the Problem of Moments
- Polynomials nonnegative on a grid and discrete optimization
- On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
- The cubic spherical optimization problems
- Maximum Block Improvement and Polynomial Optimization
- A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
- Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube
- GloptiPoly 3: moments, optimization and semidefinite programming
- Classical deterministic complexity of Edmonds' Problem and quantum entanglement
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite relaxation and nonconvex quadratic optimization
- Global Minimization of Normal Quartic Polynomials Based on Global Descent Directions
- An Eigenvalue Method for Testing Positive Definiteness of a Multivariate Form
- Blind constant modulus equalization via convex optimization
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- Complex Quadratic Optimization and Semidefinite Programming
- Approximating the Cut-Norm via Grothendieck's Inequality
- On Cones of Nonnegative Quadratic Functions
