Pages that link to "Item:Q1942279"
From MaRDI portal
The following pages link to Separation and relaxation for cones of quadratic forms (Q1942279):
Displaying 12 items.
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs (Q279802) (← links)
- Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming (Q380506) (← links)
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
- Separating doubly nonnegative and completely positive matrices (Q1942269) (← links)
- A new algorithm for concave quadratic programming (Q2010088) (← links)
- Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives (Q2156386) (← links)
- Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642) (← links)
- Copositive Programming (Q2802526) (← links)
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix (Q5086010) (← links)
- Adaptive computable approximation to cones of nonnegative quadratic functions (Q5169468) (← links)
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)