Pages that link to "Item:Q4656056"
From MaRDI portal
The following pages link to Solving generalized semi-infinite programs by reduction to simpler problems (Q4656056):
Displaying 8 items.
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
- On numerical optimization theory of infinite kernel learning (Q708898) (← links)
- Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming (Q836067) (← links)
- Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems (Q976438) (← links)
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints (Q1028592) (← links)
- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm (Q2176276) (← links)
- Lower level duality and the global solution of generalized semi-infinite programs (Q2810114) (← links)
- Outer approximation schemes for generalized semi-infinite variational inequality problems (Q3577850) (← links)