Pages that link to "Item:Q5382573"

The following pages link to DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization (Q5382573):

Displaying 50 items.

• Some applications of polynomial optimization in operations research and real-time decision making (Q276318) (← links)
• Signomial and polynomial optimization via relative entropy and partial dualization (Q823883) (← links)
• DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445) (← links)
• On sums of squares of \(K\)-nomials (Q1979337) (← links)
• Real zeros of SONC polynomials (Q1996073) (← links)
• A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
• Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
• A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
• Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
• Hybrid \(L_\infty \times \ell_\infty \)-performance analysis and control of linear time-varying impulsive and switched positive systems (Q2061234) (← links)
• Finding unstable periodic orbits: a hybrid approach with polynomial optimization (Q2077605) (← links)
• Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space (Q2079694) (← links)
• Risk-averse autonomous systems: a brief history and recent developments from the perspective of optimal control (Q2082497) (← links)
• Sparse PSD approximation of the PSD cone (Q2118107) (← links)
• Maximum feasible subsystems of distance geometry constraints (Q2131137) (← links)
• Second-order cone programming relaxations for a class of multiobjective convex polynomial problems (Q2150767) (← links)
• The \(\mathrm{PPT}^2\) conjecture holds for all Choi-type maps (Q2165072) (← links)
• Distance geometry and data science (Q2192022) (← links)
• Rejoinder on: ``Distance geometry and data science'' (Q2192024) (← links)
• Region of attraction analysis of nonlinear stochastic systems using polynomial chaos expansion (Q2208529) (← links)
• A note on convex relaxations for the inverse eigenvalue problem (Q2230796) (← links)
• On polyhedral and second-order cone decompositions of semidefinite optimization problems (Q2294533) (← links)
• Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices (Q2301196) (← links)
• Stability analysis and output-feedback synthesis of hybrid systems affected by piecewise constant parameters via dynamic resetting scalings (Q2304037) (← links)
• SONC optimization and exact nonnegativity certificates via second-order cone programming (Q2674014) (← links)
• On approximations of the PSD cone by a polynomial number of smaller-sized PSD cones (Q2687062) (← links)
• A novel moving orthonormal coordinate-based approach for region of attraction analysis of limit cycles (Q2696113) (← links)
• Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming (Q4632034) (← 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)
• Passivity and passivity indices of nonlinear systems under operational limitations using approximations (Q5020825) (← links)
• On Polyhedral Approximations of the Positive Semidefinite Cone (Q5026447) (← links)
• (Q5054600) (← links)
• Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints (Q5060505) (← links)
• Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices (Q5072587) (← links)
• Nonnegative Polynomials and Circuit Polynomials (Q5073707) (← links)
• On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity (Q5108237) (← links)
• Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs (Q5108255) (← links)
• Bounding extrema over global attractors using polynomial optimisation (Q5130916) (← links)
• A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization (Q5158762) (← links)
• Safe nonlinear control design for input constrained polynomial systems using sum-of-squares programming (Q5165345) (← links)
• Limitations on the Expressive Power of Convex Cones without Long Chains of Faces (Q5222131) (← links)
• Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces (Q5853565) (← links)
• A unified framework of SAGE and SONC polynomials and its duality theory (Q5856744) (← links)
• Mathematical programming formulations for the alternating current optimal power flow problem (Q5918268) (← links)
• Mathematical programming formulations for the alternating current optimal power flow problem (Q5918757) (← links)
• Evaluating approximations of the semidefinite cone with trace normalized distance (Q6043109) (← links)
• Higher‐order derivatives of generalized Lyapunov‐like functions for switched nonlinear systems (Q6065821) (← links)
• A Sum of Squares Characterization of Perfect Graphs (Q6087752) (← links)
• Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)