Pages that link to "Item:Q1675550"
From MaRDI portal
The following pages link to A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs (Q1675550):
Displaying 9 items.
- Estimating the robust domain of attraction for non-smooth systems using an interval Lyapunov equation (Q1737666) (← links)
- Global solution of semi-infinite programs with existence constraints (Q2031944) (← links)
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming (Q2129642) (← links)
- Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization (Q2168048) (← links)
- Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables (Q2168050) (← links)
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints (Q2274885) (← links)
- Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints (Q2664250) (← links)
- Recent advances in nonconvex semi-infinite programming: applications and algorithms (Q6114904) (← links)
- Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming (Q6155058) (← links)