Pages that link to "Item:Q644521"
From MaRDI portal
The following pages link to A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming (Q644521):
Displaying 12 items.
- Global optimization of generalized semi-infinite programs via restriction of the right hand side (Q486720) (← links)
- Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems (Q896176) (← links)
- Local optimization of dynamic programs with guaranteed satisfaction of path constraints (Q901119) (← links)
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs (Q1675550) (← links)
- Global solution of semi-infinite programs with existence constraints (Q2031944) (← 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)
- A standard branch-and-bound approach for nonlinear semi-infinite problems (Q2282532) (← links)
- A branch and bound algorithm for quantified quadratic programming (Q2397427) (← links)
- An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence (Q5093681) (← links)
- Recent advances in nonconvex semi-infinite programming: applications and algorithms (Q6114904) (← links)