The following pages link to Semidefinite Programming (Q4877532):
Displaying 13 items.
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure (Q439501) (← links)
- Path following in the exact penalty method of convex programming (Q493687) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707) (← links)
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs (Q2330644) (← links)
- A primal-dual interior-point method based on various selections of displacement step for symmetric optimization (Q2419510) (← links)
- Robust global optimization with polynomials (Q2492692) (← links)
- A computational framework of gradient flows for general linear matrix equations (Q2514275) (← links)
- Exact matrix completion via convex optimization (Q2655288) (← links)
- BEST SEPARABLE APPROXIMATION WITH SEMI-DEFINITE PROGRAMMING METHOD (Q4659847) (← links)
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization (Q5382573) (← links)
- A Characterization of Perfect Strategies for Mirror Games (Q6081983) (← links)
