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