Pages that link to "Item:Q694542"
From MaRDI portal
The following pages link to Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems (Q694542):
Displaying 4 items.
- Solving semi-infinite programs by smoothing projected gradient method (Q480937) (← links)
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming (Q2129642) (← links)
- Optimality analysis of a class of semi-infinite programming problems (Q2194121) (← links)
- Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints (Q6038645) (← links)
