Pages that link to "Item:Q1925776"
From MaRDI portal
The following pages link to The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets (Q1925776):
Displaying 14 items.
- Global optimization of generalized semi-infinite programs via restriction of the right hand side (Q486720) (← links)
- Global optimization of generalized semi-infinite programs using disjunctive programming (Q670652) (← 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)
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality (Q1938906) (← links)
- Convexification method for bilevel programs with a nonconvex Follower's problem (Q2031936) (← 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)
- On solving a class of fractional semi-infinite polynomial programming problems (Q2231044) (← links)
- How to solve a semi-infinite optimization problem (Q2253347) (← links)
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints (Q2274885) (← links)
- Guaranteed satisfaction of inequality state constraints in PDE-constrained optimization (Q2288641) (← links)
- Dynamic optimization of state-dependent switched systems with free switching sequences (Q2682298) (← links)
- Recent advances in nonconvex semi-infinite programming: applications and algorithms (Q6114904) (← links)
