Pages that link to "Item:Q3544257"
From MaRDI portal
The following pages link to The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming (Q3544257):
Displayed 17 items.
- Efficient shape optimization for certain and uncertain aerodynamic design (Q536665) (← links)
- Feasible method for generalized semi-infinite programming (Q604267) (← links)
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming (Q644521) (← links)
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems (Q694542) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Towards global bilevel dynamic optimization (Q842715) (← links)
- The semismooth approach for semi-infinite programming under the reduction ansatz (Q933800) (← links)
- Smoothing by mollifiers. I: Semi-infinite optimization (Q934789) (← links)
- Global solution of bilevel programs with a nonconvex inner program (Q1016068) (← links)
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets (Q1925776) (← links)
- A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms (Q1937084) (← links)
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality (Q1938906) (← links)
- Global solution of nonlinear mixed-integer bilevel programs (Q1959230) (← links)
- Nonlinear robust optimization via sequential convex bilevel programming (Q2434994) (← links)
- On the treatment of distributed uncertainties in PDE-constrained optimization (Q3058181) (← links)
- Global optimization of semi-infinite programs via restriction of the right-hand side (Q3111137) (← links)
- A novel feasible discretization method for linear semi-infinite programming applied to basket option pricing (Q3111142) (← links)