Semidefinite representations for finite varieties
From MaRDI portal
Publication:868441
DOI10.1007/S10107-004-0561-4zbMATH Open1152.90007OpenAlexW2133602590MaRDI QIDQ868441FDOQ868441
Recommendations
Cites work
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1984325 (Why is no real title available?)
- scientific article; zbMATH DE number 1489808 (Why is no real title available?)
- scientific article; zbMATH DE number 1757962 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Algorithms in real algebraic geometry
- An algorithm for sums of squares of real polynomials
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Global optimization with polynomials and the problem of moments
- Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
- Maximum stable set formulations and heuristics based on continuous optimization
- On the Shannon capacity of a graph
- Optimization of Polynomial Functions
- Optimization of Polynomials on Compact Semialgebraic Sets
- Polynomials nonnegative on a grid and discrete optimization
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- Revisiting two theorems of Curto and Fialkow on moment matrices
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- Semidefinite programming relaxations for semialgebraic problems
- Solution of the truncated complex moment problem for flat data
- The multidimensional moment problem
Cited in
(43)- Flat extension and ideal projection
- On the finite convergence of successive SDP relaxation methods
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
- Finite convergence of moment-SOS relaxations with nonreal radical ideals
- Optimality conditions and finite convergence of Lasserre's hierarchy
- A new approximation hierarchy for polynomial conic optimization
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
- Certifying the global optimality of quartic minimization over the sphere
- A semidefinite programming approach for solving multiobjective linear programming
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
- Homogenization for polynomial optimization with unbounded sets
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- (Global) optimization: historical notes and recent developments
- Theta bodies for polynomial ideals
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Computation with polynomial equations and inequalities arising in combinatorial optimization
- An iterative scheme for valid polynomial inequality generation in binary polynomial programming
- A linear programming reformulation of the standard quadratic optimization problem
- Solving polynomial optimization problems via the truncated tangency variety and sums of squares
- Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones
- Separation of semialgebraic sets
- Expressing combinatorial problems by systems of polynomial equations and Hilbert's Nullstellensatz
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
- scientific article; zbMATH DE number 7313221 (Why is no real title available?)
- Convex hulls of algebraic sets
- Global minimization of rational functions and the nearest GCDs
- Semidefinite programming relaxations for semialgebraic problems
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies
- Standard complexes of matroids and lattice paths
- Exploiting equalities in polynomial programming
- Minimizing polynomials via sum of squares over the gradient ideal
- Sums of squares on the hypercube
- Linear optimization with cones of moments and nonnegative polynomials
- Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases
- A dynamic inequality generation scheme for polynomial programming
- Certifying convergence of Lasserre's hierarchy via flat truncation
- A characterization of the algebraic degree in semidefinite programming
- Border basis relaxation for polynomial optimization
- Semidefinite approximations of conical hulls of measured sets
- Parametric optimization and optimal control using algebraic geometry methods
- Stochastic polynomial optimization
- Sum-of-squares hierarchies for binary polynomial optimization
This page was built for publication: Semidefinite representations for finite varieties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868441)
