Pages that link to "Item:Q2706355"

The following pages link to Global optimization with polynomials and the problem of moments (Q2706355):

Displaying 50 items.

• A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem (Q3452846) (← links)
• Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors (Q3456878) (← links)
• Convexifying Positive Polynomials and Sums of Squares Approximation (Q3457192) (← links)
• Characteristic polynomial assignment for plants with semialgebraic uncertainty: A robust diophantine equation approach (Q3458169) (← links)
• Lehman's Theorem and the Directed Steiner Tree Problem (Q3462549) (← links)
• Robust<b><i>H_∞</i></b>performance using lifted polynomial parameter-dependent Lyapunov functions (Q3543036) (← links)
• Positive polynomials and sequential closures of quadratic modules (Q3559033) (← links)
• SDP RELAXATIONS FOR QUADRATIC OPTIMIZATION PROBLEMS DERIVED FROM POLYNOMIAL OPTIMIZATION PROBLEMS (Q3560105) (← links)
• Analog circuit design by nonconvex polynomial optimization: Two design examples (Q3563580) (← links)
• Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization (Q3565467) (← links)
• New upper bounds for kissing numbers from semidefinite programming (Q3577299) (← links)
• Coarse-Convex-Compactification Approach to Numerical Solution of Nonconvex Variational Problems (Q3590027) (← links)
• On semidefinite bounds for maximization of a non-convex quadratic objective over the<i>l₁</i>unit ball (Q3635701) (← links)
• (Q4464677) (← links)
• Optimal Data Fitting: A Moment Approach (Q4555461) (← links)
• Some Recent Developments in Spectrahedral Computation (Q4556598) (← 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)
• Qualification Conditions in Semialgebraic Programming (Q4571881) (← links)
• A note on optimization with Morse polynomials (Q4582718) (← 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)
• Real Radicals and Finite Convergence of Polynomial Optimization Problems (Q4604742) (← links)
• Polynomial Norms (Q4620456) (← links)
• Stability and Bifurcations in a Model of Bacteria Immunity with Quorum Sensing (Q4628575) (← links)
• Sum-of-Squares Optimization without Semidefinite Programming (Q4629344) (← 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)
• SOS Is Not Obviously Automatizable, Even Approximately (Q4638114) (← links)
• A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674) (← links)
• A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors (Q4687245) (← links)
• (Q4904494) (← links)
• Combining qualitative information and semi‐quantitative data for guaranteed invalidation of biochemical network models (Q4909338) (← links)
• Bounding the parameters of block‐structured nonlinear feedback systems (Q4921760) (← links)
• Time-Varying Semidefinite Programs (Q4958555) (← links)
• Stabilisation of discrete-time systems via Schur stability region (Q4960155) (← links)
• Algorithm 996 (Q4960955) (← links)
• Algorithm 998 (Q4960957) (← links)
• (Q4962472) (← links)
• Bounding Extreme Events in Nonlinear Dynamics Using Convex Optimization (Q4983492) (← links)
• Convex Algebraic Geometry of Curvature Operators (Q4991379) (← links)
• Contextuality, memory cost and non-classicality for sequential measurements (Q4993418) (← links)
• Semidefinite Programming and Nash Equilibria in Bimatrix Games (Q4995090) (← links)
• Approximating sparsest cut in low rank graphs via embeddings from approximately low-dimensional spaces (Q5002624) (← links)
• The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (Q5002631) (← links)
• (Q5005186) (← links)
• Passivity and passivity indices of nonlinear systems under operational limitations using approximations (Q5020825) (← links)
• Control analysis and design via randomised coordinate polynomial minimisation (Q5027405) (← links)