Pages that link to "Item:Q4653548"
From MaRDI portal
The following pages link to Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint (Q4653548):
Displaying 15 items.
- A second-order cone cutting surface method: Complexity and application (Q839677) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- A matrix generation approach for eigenvalue optimization (Q868452) (← links)
- A note on treating a second order cone program as a special case of a semidefinite program (Q1774167) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming (Q2115314) (← links)
- The parameter-Newton iteration for the second-order cone linear complementarity problem (Q2127573) (← links)
- Outer approximation with conic certificates for mixed-integer convex problems (Q2195682) (← links)
- On polyhedral and second-order cone decompositions of semidefinite optimization problems (Q2294533) (← links)
- On representing the positive semidefinite cone using the second-order cone (Q2414901) (← links)
- Second order cone programming relaxation of nonconvex quadratic optimization problems (Q2770189) (← links)
- Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
- Further relationship between second-order cone and positive semidefinite matrix cone (Q2836094) (← links)
- Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs (Q3004990) (← links)
- (Q4964825) (← links)