The following pages link to (Q4906149):
Displaying 10 items.
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs (Q279802) (← links)
- A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis (Q697556) (← links)
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems (Q1751224) (← links)
- An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers (Q1760902) (← links)
- A cutting plane method for solving KYP-SDPs (Q2440612) (← links)
- A relaxed cutting plane method for semi-infinite semi-definite programming (Q2503018) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- A unifying framework for several cutting plane methods for semidefinite programming (Q3377972) (← links)
- (Q4400647) (← links)
- A copositive framework for analysis of hybrid Ising-classical algorithms (Q6495776) (← links)