Pages that link to "Item:Q654030"

The following pages link to Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients (Q654030):

Displaying 30 items.

• Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials (Q354616) (← links)
• Exact asymptotic stability analysis and region-of-attraction estimation for nonlinear systems (Q369723) (← links)
• Generating exact nonlinear ranking functions by symbolic-numeric hybrid method (Q394460) (← links)
• Sums of squares of polynomials with rational coefficients (Q726755) (← links)
• Exact safety verification of hybrid systems using sums-of-squares representation (Q893625) (← links)
• Global optimization of nonconvex polynomial programming problems having rational exponents (Q1387651) (← links)
• Computing the determinant of a matrix with polynomial entries by approximation (Q1621164) (← links)
• A heuristic method for certifying isolated zeros of polynomial systems (Q1634514) (← links)
• Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials (Q1733314) (← links)
• Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system (Q1744121) (← links)
• An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming (Q1994127) (← links)
• Verification protocols with sub-linear communication for polynomial matrix operations (Q1994891) (← links)
• On exact Reznick, Hilbert-Artin and Putinar's representations (Q2029015) (← links)
• Certification of real inequalities: templates and sums of squares (Q2349133) (← links)
• An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions (Q2351490) (← links)
• Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) (Q2399868) (← links)
• Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods (Q2418665) (← links)
• Automating algorithm selection: checking for matrix properties that can simplify computations (Q2422701) (← links)
• LMI stability conditions for uncertain rational nonlinear systems (Q2935342) (← links)
• On the Generation of Positivstellensatz Witnesses in Degenerate Cases (Q3088010) (← links)
• Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares (Q3576578) (← links)
• Exact Semidefinite Programming Bounds for Packing Problems (Q4989941) (← links)
• Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets (Q5043282) (← links)
• (Q5088970) (← links)
• On isolation of simple multiple zeros and clusters of zeros of polynomial systems (Q5207445) (← links)
• Bounds for Deterministic and Stochastic Dynamical Systems using Sum-of-Squares Optimization (Q5506818) (← links)
• Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients (Q5883314) (← links)
• Validating numerical semidefinite programming solvers for polynomial invariants (Q5916266) (← links)
• Complexity, exactness, and rationality in polynomial optimization (Q5925641) (← links)
• Computing sparse Fourier sum of squares on finite abelian groups in quasi-linear time (Q6657418) (← links)