Pages that link to "Item:Q1424271"

The following pages link to Semidefinite programming relaxations for semialgebraic problems (Q1424271):

Displaying 50 items.

• Preprocessing sparse semidefinite programs via matrix completion (Q3377970) (← links)
• Process Flexibility: A Distribution-Free Bound on the Performance of <i>k</i>-Chain (Q3450460) (← links)
• Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors (Q3456878) (← links)
• Characteristic polynomial assignment for plants with semialgebraic uncertainty: A robust diophantine equation approach (Q3458169) (← links)
• On long-term boundedness of Galerkin models (Q3458851) (← links)
• Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz (Q3552513) (← links)
• New upper bounds for kissing numbers from semidefinite programming (Q3577299) (← links)
• Switching and stability properties of conewise linear systems (Q3580021) (← links)
• Coarse-Convex-Compactification Approach to Numerical Solution of Nonconvex Variational Problems (Q3590027) (← links)
• Sums of squares over totally real fields are rational sums of squares (Q3617579) (← links)
• Decompositional Construction of Lyapunov Functions for Hybrid Systems (Q3624578) (← links)
• (Q4399581) (← links)
• An SOS method for the design of continuous and discontinuous differentiators (Q4561206) (← links)
• Minimizer Extraction in Polynomial Optimization Is Robust (Q4561225) (← links)
• On the Exactness of Lasserre Relaxations for Compact Convex Basic Closed Semialgebraic Sets (Q4571879) (← links)
• Greedy Approaches to Symmetric Orthogonal Tensor Decomposition (Q4588941) (← links)
• Sampling Algebraic Varieties for Sum of Squares Programs (Q4594913) (← links)
• A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems (Q4600837) (← links)
• Bifurcation Analysis of a Predator–Prey System with Ratio-Dependent Functional Response (Q4602539) (← links)
• SMOOTH UPPER BOUNDS FOR THE PRICE FUNCTION OF AMERICAN STYLE OPTIONS (Q4608116) (← links)
• Polynomial Norms (Q4620456) (← links)
• Design of Lyapunov functions for a class of homogeneous systems: Generalized forms approach (Q4629768) (← links)
• A guide to conic optimisation and its applications (Q4634309) (← links)
• Consistency Analysis for Massively Inconsistent Datasets in Bound-to-Bound Data Collaboration (Q4636381) (← links)
• Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables (Q4637505) (← links)
• Nonstationary LPV control for trajectory tracking: a double pendulum example (Q4905775) (← links)
• A Weak Approximation of Stochastic Differential Equations with Jumps Through Tempered Polynomial Optimization (Q4906406) (← links)
• Combining qualitative information and semi‐quantitative data for guaranteed invalidation of biochemical network models (Q4909338) (← links)
• Time-Varying Semidefinite Programs (Q4958555) (← links)
• Algorithm 996 (Q4960955) (← links)
• Algorithm 998 (Q4960957) (← links)
• Finding Extremal Periodic Orbits with Polynomial Optimization, with Application to a Nine-Mode Model of Shear Flow (Q4961119) (← links)
• Bounding Extreme Events in Nonlinear Dynamics Using Convex Optimization (Q4983492) (← links)
• Semidefinite Programming and Nash Equilibria in Bimatrix Games (Q4995090) (← links)
• Passivity and passivity indices of nonlinear systems under operational limitations using approximations (Q5020825) (← links)
• On a new generalised LMI condition and randomised algorithm for robust stabilisation via static-output-feedback (Q5026698) (← links)
• A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization (Q5031729) (← links)
• Further results on sum-of-squares tensors (Q5038186) (← links)
• Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← links)
• Sharper and Simpler Nonlinear Interpolants for Program Verification (Q5056007) (← links)
• Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties (Q5072221) (← links)
• Tractable Relaxations of Composite Functions (Q5085133) (← links)
• On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity (Q5108237) (← links)
• Application of direct extended modified algebraic method of Bogoyavlenskii equation on lower and upper bounds in managing and optimizing queues (Q5125359) (← links)
• Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets (Q5129197) (← links)
• A paradox in bosonic energy computations via semidefinite programming relaxations (Q5141427) (← links)
• Stability Verification for a Class of Stochastic Hybrid Systems by Semidefinite Programming (Q5145609) (← links)
• Semidefinite programming relaxations for linear semi-infinite polynomial programming (Q5151640) (← links)
• Computational and statistical tradeoffs via convex relaxation (Q5170958) (← links)
• Approximation of Model Predictive Control Laws for Polynomial Systems (Q5172925) (← links)