Border basis relaxation for polynomial optimization
From MaRDI portal
Publication:898268
DOI10.1016/j.jsc.2015.08.004zbMath1346.90655arXiv1404.5489OpenAlexW1860724031MaRDI QIDQ898268
Marta Abril Bucero, Mourrain, Bernard
Publication date: 8 December 2015
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.5489
Semidefinite programming (90C22) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (6)
On the reduction of multivariate quadratic systems to best rank-1 approximation of three-way tensors ⋮ On the equivalence of two post-quantum cryptographic families ⋮ A Polyhedral Characterization of Border Bases ⋮ Border Basis for Polynomial System Solving and Optimization ⋮ Unfoldings and the rank-one approximation of the tensor ⋮ Sparse interpolation in terms of multivariate Chebyshev polynomials
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symmetric tensor decomposition
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Semidefinite representations for finite varieties
- Introduction to the solution of polynomial systems
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- A generalized flat extension theorem for moment matrices
- Handbook of test problems in local and global optimization
- Semidefinite programming relaxations for semialgebraic problems
- Stable normal forms for polynomial system solving
- Minimizing polynomials via sum of squares over the gradient ideal
- Global Optimization with Polynomials and the Problem of Moments
- Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets
- Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
- Class of global minimum bounds of polynomial functions
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Border basis representation of a general quotient algebra
- Deciding reachability of the infimum of a multivariate polynomial
- Generalized normal forms and polynomial system solving
- Computing the global optimum of a multivariate polynomial over the reals
- Symbolic-numeric sparse interpolation of multivariate polynomials
This page was built for publication: Border basis relaxation for polynomial optimization
