Pages that link to "Item:Q4688180"
From MaRDI portal
The following pages link to On Doubly Positive Semidefinite Programming Relaxations (Q4688180):
Displaying 13 items.
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- Conic relaxations for semi-supervised support vector machines (Q289094) (← links)
- A robust Lagrangian-DNN method for a class of quadratic optimization problems (Q523570) (← links)
- Burer's key assumption for semidefinite and doubly nonnegative relaxations (Q691396) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- Binary quadratic optimization problems that are difficult to solve by conic relaxations (Q1751225) (← links)
- A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations (Q2133420) (← links)
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550) (← links)
- Fixed point theory for permissible extension type maps (Q2269955) (← links)
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
- A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems (Q3813167) (← links)
- A new perspective on low-rank optimization (Q6052053) (← links)