Pages that link to "Item:Q1773106"
From MaRDI portal
The following pages link to Interval methods for semi-infinite programs (Q1773106):
Displayed 27 items.
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
- Global optimization of generalized semi-infinite programs via restriction of the right hand side (Q486720) (← links)
- Convergence rate of McCormick relaxations (Q656830) (← links)
- Global optimization of generalized semi-infinite programs using disjunctive programming (Q670652) (← 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)
- Global solution of bilevel programs with a nonconvex inner program (Q1016068) (← links)
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs (Q1675550) (← links)
- Global solution of semi-infinite programs (Q1780954) (← links)
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets (Q1925776) (← links)
- An algorithm for semi-infinite polynomial optimization (Q1935882) (← links)
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality (Q1938906) (← 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)
- Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables (Q2168050) (← 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)
- A standard branch-and-bound approach for nonlinear semi-infinite problems (Q2282532) (← links)
- How to solve a design centering problem (Q2408900) (← links)
- Semidefinite relaxations for semi-infinite polynomial programming (Q2450900) (← links)
- Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints (Q2664250) (← links)
- Lower level duality and the global solution of generalized semi-infinite programs (Q2810114) (← links)
- Global optimization of semi-infinite programs via restriction of the right-hand side (Q3111137) (← links)
- Obtaining accurate solutions using reduced chemical kinetic models: a new model reduction method for models rigorously validated over ranges (Q3424282) (← links)
- Feasible Method for Semi-Infinite Programs (Q3461986) (← links)
- Recent advances in nonconvex semi-infinite programming: applications and algorithms (Q6114904) (← links)