Pages that link to "Item:Q276318"

The following pages link to Some applications of polynomial optimization in operations research and real-time decision making (Q276318):

Displaying 12 items.

• Global optimization of polynomials over real algebraic sets (Q1730308) (← links)
• Optimization over structured subsets of positive semidefinite matrices via column generation (Q1751222) (← links)
• Second-order cone programming relaxations for a class of multiobjective convex polynomial problems (Q2150767) (← links)
• Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy (Q2297658) (← links)
• A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
• Time-Varying Semidefinite Programs (Q4958555) (← 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)
• A unified framework of SAGE and SONC polynomials and its duality theory (Q5856744) (← links)
• Characterizing a class of robust vector polynomial optimization via sum of squares conditions (Q6161553) (← links)
• On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems (Q6200383) (← links)
• Robust second order cone conditions and duality for multiobjective problems under uncertainty data (Q6203549) (← links)