Pages that link to "Item:Q2706355"

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

Displaying 50 items.

• Certifying Polynomial Nonnegativity via Hyperbolic Optimization (Q5208888) (← links)
• The sliding Frank–Wolfe algorithm and its application to super-resolution microscopy (Q5210421) (← links)
• A Matrix Positivstellensatz with Lifting Polynomials (Q5210520) (← links)
• Stochastic polynomial optimization (Q5210742) (← links)
• A mixed PI/VI design method for nonlinear <i>H</i>_{<i><b>∞</b></i>} Control (Q5212481) (← links)
• The quintic complex moment problem (Q5216884) (← links)
• Moment methods in energy minimization: New bounds for Riesz minimal energy problems (Q5217870) (← links)
• Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing (Q5219701) (← links)
• No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
• Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems (Q5232243) (← links)
• The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (Q5232321) (← links)
• In SDP Relaxations, Inaccurate Solvers Do Robust Optimization (Q5233101) (← links)
• (Q5241586) (← links)
• An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs (Q5244155) (← links)
• A Semidefinite Hierarchy for Containment of Spectrahedra (Q5254998) (← links)
• Optimal Drug Treatment in a Simple Pandemic Switched System Using Polynomial Approach (Q5268914) (← links)
• Linearly Solvable Stochastic Control Lyapunov Functions (Q5298487) (← links)
• An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems (Q5299903) (← links)
• Robust stability, ℋ₂ analysis and stabilisation of discrete-time Markov jump linear systems with uncertain probability matrix (Q5323242) (← links)
• The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
• Bilevel Polynomial Programs and Semidefinite Relaxation Methods (Q5348472) (← links)
• Generic Properties for Semialgebraic Programs (Q5363376) (← links)
• A Positivstellensatz for Sums of Nonnegative Circuit Polynomials (Q5369248) (← links)
• Symmetric Tensor Nuclear Norms (Q5369251) (← links)
• Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations (Q5376454) (← links)
• A semidefinite method for tensor complementarity problems (Q5379459) (← links)
• DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization (Q5382573) (← links)
• Quantitative local <b>L</b>₂‐gain and Reachability analysis for nonlinear systems (Q5411828) (← links)
• Robust stabilisation of polynomial systems with uncertain parameters (Q5416398) (← links)
• PRICING A CLASS OF EXOTIC OPTIONS VIA MOMENTS AND SDP RELAXATIONS (Q5455259) (← links)
• Radii minimal projections of polytopes and constrained optimization of symmetric polynomials (Q5488627) (← links)
• Computation of parameter stability margins using polynomial programming techniques (Q5491419) (← links)
• Inhomogeneous polynomial optimization over a convex set: An approximation approach (Q5496212) (← links)
• Positive Gorenstein ideals (Q5496232) (← links)
• Limits of positive flat bivariate moment matrices (Q5496674) (← links)
• Approximating amoebas and coamoebas by sums of squares (Q5497034) (← links)
• Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200) (← links)
• Semidefinite Programming For Chance Constrained Optimization Over Semialgebraic Sets (Q5501233) (← links)
• An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution (Q5502241) (← links)
• Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems (Q5737720) (← links)
• Distributionally Robust Reward-Risk Ratio Optimization with Moment Constraints (Q5737736) (← links)
• Convergence analysis of a block improvement method for polynomial optimization over unit spheres (Q5739742) (← links)
• Well-Posedness in Unconstrained Polynomial Optimization Problems (Q5741069) (← links)
• (Q5743407) (← links)
• An Almost Optimal Algorithm for Computing Nonnegative Rank (Q5743610) (← links)
• High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts (Q5853720) (← links)
• The maximum tensor complementarity eigenvalues (Q5859001) (← links)
• A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624) (← links)
• A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition (Q5870360) (← links)
• Beating the SDP bound for the floor layout problem: a simple combinatorial idea (Q5882276) (← links)