Pages that link to "Item:Q2802517"

The following pages link to Introduction to Semidefinite, Conic and Polynomial Optimization (Q2802517):

Displaying 8 items.

• Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (Q304240) (← links)
• Improved exact approaches for row layout problems with departments of equal length (Q1651703) (← links)
• A distributed continuous-time method for non-convex QCQPs (Q1729053) (← links)
• Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
• Exact algorithms for semidefinite programs with degenerate feasible set (Q2229751) (← links)
• Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
• Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)
• Noncommutative Christoffel-Darboux kernels (Q5047921) (← links)