Semidefinite representations for finite varieties
From MaRDI portal
Publication:868441
DOI10.1007/S10107-004-0561-4zbMATH Open1152.90007OpenAlexW2133602590MaRDI QIDQ868441FDOQ868441
Publication date: 5 March 2007
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/11663
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximum stable set formulations and heuristics based on continuous optimization
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- Global optimization with polynomials and the problem of moments
- On the Shannon capacity of a graph
- Semidefinite programming relaxations for semialgebraic problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Optimization of Polynomials on Compact Semialgebraic Sets
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Algorithms in real algebraic geometry
- Solution of the truncated complex moment problem for flat data
- Revisiting two theorems of Curto and Fialkow on moment matrices
- Optimization of Polynomial Functions
- Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
- The multidimensional moment problem
- An algorithm for sums of squares of real polynomials
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- Polynomials nonnegative on a grid and discrete optimization
Cited In (38)
- A dynamic inequality generation scheme for polynomial programming
- Stochastic polynomial optimization
- Title not available (Why is that?)
- Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies
- Exploiting equalities in polynomial programming
- Homogenization for polynomial optimization with unbounded sets
- Standard complexes of matroids and lattice paths
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization
- Flat extension and ideal projection
- A linear programming reformulation of the standard quadratic optimization problem
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz
- Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases
- Parametric optimization and optimal control using algebraic geometry methods
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Convex Hulls of Algebraic Sets
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Solving polynomial optimization problems via the truncated tangency variety and sums of squares
- An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming
- Linear optimization with cones of moments and nonnegative polynomials
- A semidefinite programming approach for solving multiobjective linear programming
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Finite convergence of moment-SOS relaxations with nonreal radical ideals
- Certifying the global optimality of quartic minimization over the sphere
- Global minimization of rational functions and the nearest GCDs
- Minimizing polynomials via sum of squares over the gradient ideal
- Sums of squares on the hypercube
- Border basis relaxation for polynomial optimization
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
- Breaking symmetries to rescue sum of squares in the case of makespan scheduling
- Separation of semialgebraic sets
- A new approximation hierarchy for polynomial conic optimization
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
- Semidefinite approximations of conical hulls of measured sets
- Sum-of-squares hierarchies for binary polynomial optimization
- (Global) optimization: historical notes and recent developments
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
Uses Software
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)
