Pages that link to "Item:Q312665"
From MaRDI portal
The following pages link to On conic QPCCs, conic QCQPs and completely positive programs (Q312665):
Displaying 6 items.
- Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization (Q283932) (← links)
- Applying ranking and selection procedures to long-term mitigation for improved network restoration (Q339947) (← links)
- A penalty method for rank minimization problems in symmetric matrices (Q1616933) (← links)
- Completely positive reformulations of polynomial optimization problems with linear constraints (Q1679621) (← links)
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems (Q1751224) (← links)
