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 8 items.
- Solving semi-infinite programs by smoothing projected gradient method (Q480937) (← links)
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets (Q1925776) (← 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)
- A relaxed cutting plane method for semi-infinite semi-definite programming (Q2503018) (← 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)