Pages that link to "Item:Q2503018"
From MaRDI portal
The following pages link to A relaxed cutting plane method for semi-infinite semi-definite programming (Q2503018):
Displaying 9 items.
- Relaxed cutting plane method for solving linear semi-infinite programming problems (Q1969533) (← links)
- Semidefinite relaxations for semi-infinite polynomial programming (Q2450900) (← links)
- A unifying framework for several cutting plane methods for semidefinite programming (Q3377972) (← links)
- (Q3748063) (← links)
- (Q4400647) (← links)
- (Q4906149) (← links)
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization (Q5245362) (← links)
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme (Q5936072) (← links)
- Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints (Q6038645) (← links)