Pages that link to "Item:Q1029543"

The following pages link to Semidefinite characterization and computation of zero-dimensional real radical ideals (Q1029543):

Displaying 42 items.

• Algebraic criteria of global observability of polynomial systems (Q286289) (← links)
• Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials (Q312198) (← links)
• Real ideal and the duality of semidefinite programming for polynomial optimization (Q351462) (← links)
• The truncated moment problem via homogenization and flat extensions (Q452366) (← links)
• Design of Marx generators as a structured eigenvalue assignment (Q472612) (← links)
• A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals (Q492020) (← links)
• On the computation of matrices of traces and radicals of ideals (Q654040) (← links)
• Khovanskii-Rolle continuation for real solutions (Q660674) (← links)
• Semidefinite programming for min-max problems and games (Q662286) (← links)
• A semidefinite programming approach for solving multiobjective linear programming (Q742135) (← links)
• Linear optimization with cones of moments and nonnegative polynomials (Q745685) (← links)
• Moments and sums of squares for polynomial optimization and related problems (Q842714) (← links)
• Border basis relaxation for polynomial optimization (Q898268) (← links)
• A prolongation-projection algorithm for computing the finite real variety of an ideal (Q1029340) (← links)
• A generalized flat extension theorem for moment matrices (Q1039946) (← links)
• Tensor eigenvalue complementarity problems (Q1659680) (← links)
• A semidefinite approach for truncated \(K\)-moment problems (Q1928277) (← links)
• Numerically computing real points on algebraic sets (Q1956231) (← links)
• Generators for the \(C^m\)-closures of ideals (Q2031505) (← links)
• Optimization over trace polynomials (Q2068367) (← links)
• An SDP relaxation method for Perron pairs of a nonnegative tensor (Q2113709) (← links)
• Local saddle points for unconstrained polynomial optimization (Q2125068) (← links)
• Positivity certificates and polynomial optimization on non-compact semialgebraic sets (Q2149557) (← links)
• Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
• Computing real radicals and \(S\)-radicals of polynomial systems (Q2200311) (← links)
• Tensor complementarity problems. II: Solution methods (Q2275317) (← links)
• Higher-degree tensor eigenvalue complementarity problems (Q2307709) (← links)
• Test of copositive tensors (Q2313772) (← links)
• Tight relaxations for polynomial optimization and Lagrange multiplier expressions (Q2330641) (← links)
• Certifying convergence of Lasserre's hierarchy via flat truncation (Q2434992) (← links)
• Quadratic tensor eigenvalue complementarity problems (Q2691299) (← links)
• Convex generalized Nash equilibrium problems and polynomial optimization (Q2693649) (← links)
• The Approach of Moments for Polynomial Equations (Q2802518) (← links)
• Convex Hulls of Algebraic Sets (Q2802521) (← links)
• Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
• Deciding Polyhedrality of Spectrahedra (Q2949514) (← links)
• Homogenization for polynomial optimization with unbounded sets (Q6044977) (← links)
• A hierarchy of spectral relaxations for polynomial optimization (Q6062883) (← links)
• Semidefinite Relaxation Methods for Tensor Absolute Value Equations (Q6066099) (← links)
• VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities (Q6076836) (← links)
• Distance to a constitutive tensor isotropy stratum by the Lasserre polynomial optimization method (Q6082663) (← links)
• Rational Generalized Nash Equilibrium Problems (Q6116245) (← links)