Pages that link to "Item:Q2397758"

The following pages link to A bounded degree SOS hierarchy for polynomial optimization (Q2397758):

Displaying 41 items.

• On polynomial optimization over non-compact semi-algebraic sets (Q481041) (← links)
• Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations (Q721169) (← links)
• Signomial and polynomial optimization via relative entropy and partial dualization (Q823883) (← links)
• Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity (Q1646680) (← links)
• A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem (Q1657401) (← links)
• A multilevel analysis of the Lasserre hierarchy (Q1735163) (← links)
• A new algorithm for concave quadratic programming (Q2010088) (← links)
• A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
• A sublevel moment-SOS hierarchy for polynomial optimization (Q2070330) (← 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)
• On the tightness of semidefinite relaxations for rotation estimation (Q2127273) (← links)
• Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550) (← links)
• Sparse noncommutative polynomial optimization (Q2144551) (← links)
• Positivity certificates and polynomial optimization on non-compact semialgebraic sets (Q2149557) (← links)
• Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
• Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy (Q2297658) (← links)
• Tight relaxations for polynomial optimization and Lagrange multiplier expressions (Q2330641) (← links)
• A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
• Certifying convergence of Lasserre's hierarchy via flat truncation (Q2434992) (← links)
• Positive maps and separable matrices (Q2810548) (← links)
• A Lagrangian relaxation view of linear and semidefinite hierarchies (Q2866205) (← links)
• A New Look at Nonnegativity on Closed Sets and Polynomial Optimization (Q3105778) (← links)
• Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables (Q4637505) (← links)
• LP Formulations for Polynomial Optimization Problems (Q4637509) (← links)
• Algorithm 996 (Q4960955) (← links)
• (Q4963653) (← links)
• New Dependencies of Hierarchies in Polynomial Optimization (Q5121114) (← links)
• Computing the Hausdorff Boundary Measure of Semialgebraic Sets (Q5130991) (← links)
• TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity (Q5148403) (← links)
• Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension (Q5148406) (← links)
• A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization (Q5158762) (← links)
• Moment Problem and Its Applications to Risk Assessment (Q5379219) (← links)
• DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization (Q5382573) (← links)
• Homogenization for polynomial optimization with unbounded sets (Q6044977) (← links)
• A hierarchy of spectral relaxations for polynomial optimization (Q6062883) (← links)
• A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization (Q6081938) (← links)
• Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets (Q6561376) (← links)
• CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization (Q6599983) (← links)
• Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling (Q6631573) (← links)
• Finding global minima via kernel approximations (Q6665395) (← links)