Pages that link to "Item:Q868441"
From MaRDI portal
The following pages link to Semidefinite representations for finite varieties (Q868441):
Displaying 36 items.
- A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
- Sums of squares on the hypercube (Q329957) (← links)
- Optimality conditions and finite convergence of Lasserre's hierarchy (Q403636) (← links)
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs (Q431017) (← links)
- Semidefinite approximations of conical hulls of measured sets (Q512256) (← links)
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz (Q650840) (← links)
- A semidefinite programming approach for solving multiobjective linear programming (Q742135) (← links)
- Linear optimization with cones of moments and nonnegative polynomials (Q745685) (← links)
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals (Q863907) (← links)
- A linear programming reformulation of the standard quadratic optimization problem (Q868634) (← links)
- Border basis relaxation for polynomial optimization (Q898268) (← links)
- Exploiting equalities in polynomial programming (Q935230) (← links)
- Semidefinite characterization and computation of zero-dimensional real radical ideals (Q1029543) (← links)
- Solving polynomial optimization problems via the truncated tangency variety and sums of squares (Q1030710) (← links)
- Flat extension and ideal projection (Q1635276) (← links)
- Standard complexes of matroids and lattice paths (Q2155637) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions (Q2330641) (← links)
- A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
- Certifying convergence of Lasserre's hierarchy via flat truncation (Q2434992) (← links)
- Global minimization of rational functions and the nearest GCDs (Q2481368) (← links)
- Minimizing polynomials via sum of squares over the gradient ideal (Q2492680) (← links)
- Convex Hulls of Algebraic Sets (Q2802521) (← links)
- Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
- An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz (Q3552513) (← links)
- Separation of semialgebraic sets (Q4243740) (← links)
- (Q4963653) (← links)
- Stochastic polynomial optimization (Q5210742) (← links)
- Parametric optimization and optimal control using algebraic geometry methods (Q5423850) (← links)
- Sum-of-squares hierarchies for binary polynomial optimization (Q5925640) (← links)
- Homogenization for polynomial optimization with unbounded sets (Q6044977) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)
- Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases (Q6170824) (← links)
