Pages that link to "Item:Q337405"
From MaRDI portal
The following pages link to Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405):
Displaying 11 items.
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
- A new algorithm for concave quadratic programming (Q2010088) (← links)
- A relaxed cutting plane method for semi-infinite semi-definite programming (Q2503018) (← links)
- Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes (Q2696926) (← links)
- (Q2751323) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- A unifying framework for several cutting plane methods for semidefinite programming (Q3377972) (← links)
- (Q4400647) (← links)
- Solving Quadratic Programming by Cutting Planes (Q4634098) (← links)
- (Q4906149) (← links)
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme (Q5936072) (← links)
